LeetCode1046 最后一块石头的重量（贪心—Java优先队列简单应用）

            import java.util.*;
import java.math.*;

class Solution {
    static Comparator<Integer> cmp = new Comparator<Integer>() {
        @Override
        publicint compare(Integer o1, Integer o2) {
            return o2-o1;
        }
    };
    publicint lastStoneWeight(int[] stones) {
        Queue<Integer> queue = new PriorityQueue<>(cmp);
        for(int i=0; i<stones.length; i++){
            queue.add(stones[i]);
        }
        while(queue.size() > 1){
            int a = queue.poll();
            int b = queue.poll();
            //System.out.println(a+" "+b);
            queue.add(Math.max(a,b) - Math.min(a,b));
        }
        return queue.poll();
    }
}

publicclass Main {
    publicstaticvoid main(String[] args){
        Scanner scanner = new Scanner(System.in);
        Solution solution = new Solution();
        int n = scanner.nextInt();
        int[] chips = newint[n];
        for(int i=0; i<n; i++){
            chips[i] = scanner.nextInt();
        }
        System.out.println(solution.lastStoneWeight(chips));
    }
}