摘要：原始代码错误，移步博客查看O(N^2)及优化的O(N logN)的实现： "每天一道编程题——最长递增子序列" 阅读全文

摘要：1 public int binarySearch(int[] nums, int target) { 2 int low = 0; 3 int high = nums.length; 4 while (low <= high) { 5 int mid = (low + high) / 2; 6 ... 阅读全文

摘要：1 public void bubbleSort(int[] nums) { 2 for (int i = 0; i < nums.length; i++) 3 for (int j = 0; j < nums.length - 1 - i; j++) { 4 if (nums[j] < nums[j + 1... 阅读全文

摘要：快速排序： 阅读全文