摘要:
class Solution { public int lastStoneWeight(int[] stones) { MaxHeap s=new MaxHeap(stones.length+1); for(int i=0;i<stones.length;i++) { s.insert(stones 阅读全文
posted @ 2019-07-17 15:34
小路不会迷路
阅读(168)
评论(0)
推荐(0)
摘要:
public class MaxHeap { private int[] data; private int count; private int capacity; public MaxHeap(int capacity){ this.capacity=capacity; data=new int 阅读全文
posted @ 2019-07-17 11:11
小路不会迷路
阅读(305)
评论(0)
推荐(0)
浙公网安备 33010602011771号