2021年8月20日
[LeetCode] 1339. Maximum Product of Splitted Binary Tree
摘要： Given the root of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is max 阅读全文
posted @ 2021-08-20 11:01 CNoodle 阅读(252) 评论(0) 推荐(0)
[LeetCode] 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
摘要： Given an array nums, you are allowed to choose one element of nums and change it by any value in one move. Return the minimum difference between the l 阅读全文
posted @ 2021-08-20 00:59 CNoodle 阅读(448) 评论(0) 推荐(0)