剑指offer 1384 二维数组中的查找

最新推荐文章于 2023-02-11 10:33:28 发布

xiaohunuli

最新推荐文章于 2023-02-11 10:33:28 发布

阅读量279

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/xiaohunuli/article/details/37880437

版权

剑指offer 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

</pre><pre name="code" class="cpp">

<pre name="code" class="cpp">

http://ac.jobdu.com/problem.php?pid=1384

#include<stdio.h>
 
int binary_search(int a[],int l,int r,int t){
    int begin=l;
    int end=r;
  while(begin<=end){
     int mid=(begin+end)/2;
     if(t==a[mid])
         return 1;
     else if(t<a[mid])
          end=mid-1;
     else   begin=mid+1;
  }
    return 0;
}
 
int main()
{
  int m,n,a[1000000],i,j,t;
  while(scanf("%d%d",&m,&n)!=EOF){
    
    scanf("%d",&t);
    for(i=0;i<m;i++)
        for(j=0;j<n;j++){
          scanf("%d",&a[n*i+j]);
        }
        if(binary_search(a,0,m*n-1,t)) 
            printf("Yes\n");
                
        else
             printf("No\n");
                 
  }
 
}
/**************************************************************
    Problem: 1384
    Language: C++
    Result: Accepted
    Time:680 ms
    Memory:4856 kb
****************************************************************/

#include<stdio.h>
#define N 1001
int Matrix[N][N];
int find(int Matrix[N][N],int m,int n,int t){
    int i=0,j=n-1;
    while(i<m&&j>=0){
      if(t==Matrix[i][j])
          return 1;
      else if(t<Matrix[i][j])
          j--;
      else if(t>Matrix[i][j])
          i++;
    }
return 0;
}
int main(){
  int m,n,i,j,t;
  while(scanf("%d%d",&m,&n)!=EOF){
    scanf("%d",&t);
  for(i=0;i<m;i++)
      for(j=0;j<n;j++){
        scanf("%d",&Matrix[i][j]);
      }
  int r= find(Matrix,m,n,t);
      if(r==1)
          printf("Yes\n");
      else
          printf("No\n");
  }
 
}
/**************************************************************
    Problem: 1384
    Language: C++
    Result: Accepted
    Time:680 ms
    Memory:4936 kb
****************************************************************/

#include<stdio.h>
  
    int main(){
    int m,n,t,i,j;
    int a[1000][1000];
    while(scanf("%d%d",&m,&n)!=EOF){
     scanf("%d",&t);
     for(i=0;i<m;i++)
         for(j=0;j<n;j++){
          scanf("%d",&a[i][j]);
         }
         int flag=0;
        for(i=0;i<m;i++)
            for(j=0;j<n;j++){
            if(a[i][j]==t)
             flag=1;
            }
  
        if(flag)
            printf("%s\n","Yes");
        else
            printf("%s\n","No");
    }
}
/**************************************************************
    Problem: 1384
    Language: C++
    Result: Accepted
    Time:660 ms
    Memory:4856 kb
****************************************************************/