情人节也放假

public static int search(int[] arr, int key) { int start = 0; int end = arr.length - 1; while (start <= end) { int middle = (start + end) / 2; if (key < arr[m

参考：http://blog.youkuaiyun.com/cxming007/article/details/23738643public static Integer findOnlyNum1(int[] array){ int result = 0; for(int i = 0 ;i<array.length;i++){ result^=array[i];

public static char getChar(String text){ char c =0xff; for(int index =0;index <text.length();index ++){ c =text.charAt(index); if(text.indexOf(c) ==text.lastIndexO

一、遍历反转public static Node reverse2(Node head) { if (head == null) return head; Node pre = head;// 上一结点 Node cur = head.getNext();// 当前结点 Node tmp;//

public void quicksort(int[] v, int left, int right) { if (left < right) { int key = v[left]; int low = left; int high = right; while (low < high)

题目示例：已知两顺序整数集合，求交集

题目示例：17个人围一桌，轮番报数，报到3的退出，知道桌上只留下1人