摘要:
思路 手撕快速排序。 class Solution { public int[] sortArray(int[] nums) { // 手撕快速排序 int left = 0, right = nums.length-1; quickSort(nums, left, right); return n 阅读全文
摘要:
思路 方法:二分搜索 class Solution { public int search(int[] nums, int target) { int left, mid, right; left = 0; right = nums.length-1; while(left <= right) { 阅读全文