lilizhibing的专栏

  public static int search(int[] array, int v) { int start = 0; int end = array.length - 1; int mid = 0; while ((start + 1) < end) { mid = (start ...

package base; import java.util.Arrays; /** * Created by shanks on 17/8/5. */ public class HeapSort { public static void main(String[] args) { int a[] = { 16, 7, 17, 3, 8, 20,15 }; ...

问题：找出数组中第一个重复出现的数字，数组为连续并且有序 代码如下 public static int search_dis(){ int[] nums={2, 4, 8, 5, 7, 6, 1, 9, 3, 2}; int first = 0,second = 0; do{ first=nums[first]; second=...

借助一个队列，每当指针到达某一节点时，把该节点的左右两个节点顺序存储到队列中去，周而复始。 public static void levelOrderPrint(BinaryNode node){ if(node==null) return; LinkedList q1=new LinkedList(); q1.offer(node); whi

package Graph; import edu.princeton.cs.algs4.In; import java.util.NoSuchElementException; import java.util.Stack; /** * Created by shanks on 18/3/13. */ public class Graph { private final int...

package base; /** * Created by shanks on 18/4/18. * 得到中位数O(N) */ public class Median { public static int getMedian(int []nums){ if(nums.length==0) return 0; int sta...