摘要: 原题链接在这里:https://leetcode.com/problems/minimum-cost-to-merge-stones/ 题目: There are N piles of stones arranged in a row. The i-th pile has stones[i] sto 阅读全文
posted @ 2019-09-04 13:05 Dylan_Java_NYC 阅读(367) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/ 题目: Given an array arr of positive integers, consider all binary trees such 阅读全文
posted @ 2019-09-04 10:54 Dylan_Java_NYC 阅读(2488) 评论(0) 推荐(0) 编辑