www

摘要： public ListNode mergeKLists(ListNode[] lists) { if(lists==null||lists.length==0) return null; PriorityQueue minHeap=new PriorityQueue((o1, o1)->{ return o1.val-o2.val; ... 阅读全文

摘要： public List topKFrequent(int[] nums, int k){ List ret = new ArrayList(); if (nums==null || nums.length map = new HashMap(); for (int n:nums) map.put(n,map.getOrDefault(n,0)+1)... 阅读全文

摘要： private int minNumberInRotateArray(int [] array) { if (array == null || array.length == 0) { throw new RuntimeException("input is invalid"); } int index1 = 0;... 阅读全文

摘要： 1 private int binarySearch(int[] input, int target) { 2 if (input == null) { 3 return -1; 4 } 5 6 int index1 = 0; 7 int index2 = input.length-1... 阅读全文

摘要： 1 private void quickSort(int[] input, int start, int end) { 2 if (start >= end) return; 3 4 int index = partition(input, start, end); 5 6 if (index > start) { 7 ... 阅读全文

摘要： System.out.println(ResourceUtils.getURL("classpath:").getPath()); 阅读全文

摘要： https://www.ibm.com/developerworks/cn/linux/l-cn-sshforward/ 阅读全文

摘要： 25, "name"=>"li", "aa"=>22); $array[] = array("age"=>24,"name"=>"ai", "aa"=>24); $array[] = array("age"=>23,"name"=>"ci", "aa"=>23); $array[] = array("age"= 阅读全文

摘要： Fruit.java Apple.java ProxyHandler.java Run.java 阅读全文

摘要： Fruit.java Apple.java FruitProxy.java Run.java 阅读全文