二级指针
二级指针变量开辟4个字节(32位系统)
整型二级指针变量存放整型一级指针变量的地址,整型一级指针变量存放整型变量的地址,整型变量存放数据
二级指针有三个值:
- 自身的值: s
- 解一次引用,直接指向: *s
- 解两次引用,指向的指向: **s
指向数组的指针:
二维数组
区分一维数组与二维数组:
int main()
{
int ar[5][2] = { 1,2,3,4,5,6,7,8,9,10 };
int(*s)[2] = &ar[1];
int* p = ar[1];
printf("%d \n", s[2][3]);//10
printf("%d \n", p[3]);//6
return 0;
}
二维数组的打印
void Print_Ar(int br[3][4], int row, int col)
//等价于:void Print_Ar(int br[][4], int row, int col)
//void Print_Ar(int (*br)[4], int row, int col)
{
/*int size = sizeof(br);
printf("%d \n", size); 打印4 */
assert(br != nullptr);
for (int i = 0;i < row;++i)
{
for (int j = 0;j < col;++j)
{
printf("%5d", br[i][j]);
}
printf("\n");
}
printf("\n");
}
int main()
{
int ar[3][4] = { 1,2,3,4,5,6,7,8,9,10,11,12 };
Print_Ar(ar, 3, 4);
return 0;
}
二维数组的分块查询
int FindValue(int(*br)[4], int row, int col, int val)
{
assert(br != nullptr);
int r = 0, c = col - 1;
while (r < row && br[r][c] < val)
{
r += 1;
}
if (r == row) return -1;//查询的数据大于最后一个数据
int j = c;
for (;j >= 0;--j)
{
if (br[r][j] == val)
{
break;
}
}
if (j < 0) return -1;//查询的数据不存在
return r * col + j;
}
int FindValue_A(int(*br)[4], int row, int col, int val)//分块查询
{
assert(br != nullptr);
int r = 0, c = col - 1;
while (r < row && br[r][c] < val)
{
r += 1;
}
if (r == row) return -1;
while (c >= 0 && br[r][c] > val)
{
c = c - 1;
}
if (c < 0) return -1;
return r * col + c;
}
int main()
{// 0 1 2 3
int ar[3][4] = { 12,23,34,45, // 0
48,56,67,78, // 1
80,85,89,90 }; // 2
int val;
scanf_s("%d", &val);
int pos = FindValue(ar, 3, 4, val);
printf("%d \n", pos);
if ( pos != -1)
{
printf("row=%d col=%d \n", pos/4,pos% 4);
}
return 0;
}
有序二维数组的二分查询
原因:
- 每一行从小到大存放
- 第 i 行的最后一个元素小于第 i+1 行的第一个元素
- 在内存中连续存放这些数据
int FindValue_B(int(*br)[4], int row, int col, int val)//二分查询
{
assert(br != nullptr);
int* ip = (int*)br;
int left = 0, right = row * col - 1;
int pos = -1;
while (left <= right)
{
int mid = (right - left) / 2 + left;
if (val < ip[mid])
{
right = mid - 1;
}
else if (val > ip[mid])
{
left = mid + 1;
}
else
{
pos = mid;
break;
}
}
return pos;
}