第一种:暴力循环
public class Solution {
public boolean Find(int target, int [][] array) {
boolean ans = false;
int n = array[0].length,flag=array.length-1;
for (int i=0;i<n;i++){
for (int j=0;j<=flag;j++){
if (array[i][j]==target) return true;
}
}
return ans;
}
}
第二种:循环夹二分查找
public class Solution {
public boolean search(int []nums,int target){
int left = 0,right =nums.length-1,mid = (left+right)/2;
while (left<=right){
if (nums[mid]==target) return true;
if (nums[mid]>target){//
right=mid-1;
}else {
left=mid+1;
}
mid=(left+right)/2;
}
return false;
}
public boolean Find(int target, int [][] array) {
boolean ans = false;
int n = array[0].length,flag=array.length-1;
for (int i=0;i<n;i++){
ans = search(array[i],target);
if (ans) return true;
}
return ans;
}
}