一,指针与二维数组
int ar[3][4]={1,2,3,4,5,6,7,8,9,10,11,12};
int (*s)[4]=ar;此时的ar代表二维数组首元素的地址即一个一维数组的地址
int (*par)[3][4]=&ar;par指向该二维数组的地址
int main()
{
int ar[5][2]={1,2,3,4,5,6,7,8,9,10};
int (*p)[2]=&ar[1];p此时指向ar[1]={3,4}数组的地址
int *s=ar[1];s此时指向ar[1]={3,4}首元素3的地址
printf("%d"\n,p[1][3]);
8 此时p[1][3]=*(p[1]+3)=*(*(p+1)+3)
printf("%d"\n,s[3]);
6 此时s[3]=*(s+3);
return 0;
}
二,指针数组的地址及其首元素的地址
int main()
{
int a=10,b=20,c=30,d=40;
int *ar[4]={&a,&b,&c,&d};
int *(*p)=&ar;
int **s=ar;
return 0;
}
三,打印二维数组
#include<stdio.h>
#include<assert.h>
#define ROW 3
#define COL 4
void Printf_ar(int (*p)[4],int count)
{
assert(p!=nullptr);
for(int i=0;i<ROW;i++)
{
for(int j=0;j<COL;j++)
{
printf("%d ",p[i][j]);
}
printf("\n");
}
}
int main()
{
int ar[ROW][COL]={1,2,3,4,5,6,7,8,9,10,11,12};
int n=sizeof(ar)/sizeof(ar[0][0]);
Printf_ar(ar,n);
return 0;
}
四,二维数组的分块查找
#include<stdio.h>
#include<assert.h>
#define ROW 4
#define COL 5
int Find_val(int (*p)[COL],int val)
{
inrt i=0;
while(i<ROW&&p[i][COL-1]<val)
{
i++;
}
if(i>ROW-1) return -1;
int j=0;
while(j<COL&&p[i][j]<val)
{
j++;
}
if(j>COL-1) return -1;
return i*ROW+j;
}
int main()
{
int ar[4][5]={{2,4,6,8,10,12},
{12,14,16,18,20},
{22.24,26,28,30},
{32,34,36,38,40}
};
Find_val(ar,36);
return 0;
}
五,二维数组的二分查找
#include<stdio.h>
#include<assert.h>
#define ROW 4
#define COL 5
int Find_val(int (*p)[COL],int val)
{
assert(p!=nullptr);
int pos=-1;
int *s=*p;
int left=0,right=COL*ROW-1;
while(left<=right)
{
int mid =(left+right)/2;
if(val>s[mid])
{
left=mid;
}
else if(val<s[mid])
{
right=mid;
}
else
{
pos=mid;
break;
}
}
return pos;
}
int main()
{
int ar[4][5]={{2,4,6,8,10,12},
{12,14,16,18,20},
{22.24,26,28,30},
{32,34,36,38,40}
};
Find_val(ar,36);
return 0;
}