lintcode 1872 · Minimum Cost to Connect Sticks

https://www.lintcode.com/problem/1872/description

[brainstorm]
1 go through two given cases
2 see pattern
sum up smallest and second smallest,
repeat the same calculation.
3 use list
insert sum into list cost O(n)
say n number, then O(n^2), not good.
say use two list, the same thing.
4 consider smallest and second smallest for a few seconds.
heap is good structure for this.

public class Solution {
    /**
     * @param sticks: the length of sticks
     * @return: Minimum Cost to Connect Sticks
     */
    public int MinimumCost(List<Integer> sticks) {
        // write your code here

        PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
        for(int stick: sticks){
            pq.add(stick);
        }

        int ret = 0;
        while(pq.size() >= 2){
            int num1 = pq.poll();
            int num2 = pq.poll();
            int sum = num1 + num2;
            pq.add(sum);
            ret += sum;
        }
        return ret;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值