2021年3月1日
[LeetCode] 1046. Last Stone Weight 最后的石头重量
摘要： We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppos 阅读全文
posted @ 2021-03-01 12:31 Grandyang 阅读(1310) 评论(0) 推荐(0)
[LeetCode] 1043. Partition Array for Maximum Sum 分隔数组以得到最大和
摘要： Given an integer array , you should partition the array into (contiguous) subarrays of length at most . After partitioning, each subarray has their va 阅读全文
posted @ 2021-03-01 08:51 Grandyang 阅读(1235) 评论(1) 推荐(0)
Fork me on GitHub