java-两数之和-二分法

public static int[] soult(int nums[],int target){
		//二分查找
	  for(int i=0;i<nums.length;i++){
		  int low=i;//定义low为最小值
		  int hight=nums.length-1;
		  int mid=low+(hight-low)/2;
		  while(low<=hight){
			  if(nums[mid]==target-nums[i]){
				  return new int[]{i,mid};
			  }
			  else if(nums[mid]<target-nums[i]){
				  low=mid+1;
			  }else
			  {
				  hight=mid-1;
			  }
		  }
	  }
	return new int[]{0};
	  }
	}

升序就用二分查找