1.二分查找

1.1 思想

对于有序不重的数组可以使用二分查找加速查询的效率，给数组新建头尾指针，对比中间值与左右指针所指示的值的大小进行指针移动，进行夹逼.

1.2 代码

class Solution {public int search(int[] nums, int target) {int leftPoint = 0; //初始化最左指针int rightPoint = nums.length - 1; //初始化最右指针int middle = 0;while (leftPoint<=rightPoint){//计算middlemiddle = leftPoint + (rightPoint - leftPoint)/2;if(nums[middle] == target){return middle;}else if(nums[middle] < target){leftPoint = middle + 1;}else{rightPoint = middle - 1;}}return -1;}
}

1.3  inspirations

利用指针