public class First { public static void main(String[] args) { boolean a = false; boolean b = true; boolean c = false; if (a || b && c){ System.out.println("ok"); } } } 上面什么也不输出,当把c改为true输出为ok 由此可见,是先运算 b&&c 再运算 a ||
package com.lk.A; import java.util.PriorityQueue; public class Test5 { public static void main(String[] args) { PriorityQueue<Integer> queue = new PriorityQueue<Integer>(); for(int i=5;i>0;i--){ queue.offer(i); } while(!queue.isEmpty()){ Sy
优先级队列数组实现: public class PriorityQueue { private int[] data; private int size; public PriorityQueue(int size){ data = new int[size]; this.size = 0; } public void push(int toInsert) throws Exception{ if(size == data.length) throw new Exception("Queue i
//设计一个找到数据流中第K大元素的类(class). //注意是排序后的第K大元素,不是第K个不同的元素. class KthLargest { private PriorityQueue<Integer> queue; private int k = 0; public KthLargest(int k, int[] nums) { queue = new PriorityQueue(k); this.k = k; for(int i = 0; i < nums.length;i++
