1167. 连接棒材的最低费用

class Solution {
    public int connectSticks(int[] sticks) {

        int sum = 0;
        if (sticks.length==0 || sticks.length==1){
            return 0;
        }
        Queue<Integer> queue = new PriorityQueue();

        for (int i = 0; i < sticks.length; i++) {
            queue.add(sticks[i]);
        }

        while(queue.size()>2){
            int l = queue.poll();
            int k = queue.poll();
            sum += l;
            sum += k;
            queue.add(l+k);
        }

        sum += queue.poll();
        sum += queue.poll();

        return sum;

    }
}