当前位置:网站首页>c语言指针运算
c语言指针运算
2022-08-02 05:19:00 【Code Writers】
文章目录
前言
一、指针和数组笔试题解析
1.1 一维数组
1.2 字符数组
1.3 二维数组
2. 指针笔试题
总结
前言
指针面试题,对指针的理解不再停留在简单的知识层面上,而是可以知道面试题中指针的考察是怎样的;
一、指针和数组笔试题解析
1.1 一维数组
首先说一下知识点:很重要!!!
数组名的意义:
sizeof(数组名),这里的数组名表示整个数组,计算的是整个数组的大小。
&数组名,这里的数组名表示整个数组,取出的是整个数组的地址。
除此之外所有的数组名都表示首元素的地址。
int a[ ] = {1,2,3,4};
printf( “%d\n”,sizeof(a) );
printf( “%d\n”,sizeof(a+0) );
printf( “%d\n”,sizeof(a) );
printf( “%d\n”,sizeof(a+1) );
printf( “%d\n”,sizeof(a[1]) );
printf( “%d\n”,sizeof(&a) );
printf( “%d\n”,sizeof(&a) ;
printf( “%d\n”,sizeof(&a+1) );
printf( “%d\n”,sizeof(&a[0]) );
printf( “%d\n”,sizeof(&a[0]+1) );
1.2 字符数组
char arr[] = {‘a’,‘b’,‘c’,‘d’,‘e’,‘f’};
printf(“%d\n”, sizeof(arr));
printf(“%d\n”, sizeof(arr+0));
printf(“%d\n”, sizeof(*arr));
printf(“%d\n”, sizeof(arr[1]));
printf(“%d\n”, sizeof(&arr));
printf(“%d\n”, sizeof(&arr+1));
printf(“%d\n”, sizeof(&arr[0]+1));
printf(“%d\n”, strlen(arr));
printf(“%d\n”, strlen(arr+0));
printf(“%d\n”, strlen(*arr));
printf(“%d\n”, strlen(arr[1]));
printf(“%d\n”, strlen(&arr));
printf(“%d\n”, strlen(&arr+1));
printf(“%d\n”, strlen(&arr[0]+1));
char arr[] = “abcdef”;
printf(“%d\n”, sizeof(arr));
printf(“%d\n”, sizeof(arr+0));
printf(“%d\n”, sizeof(*arr));
printf(“%d\n”, sizeof(arr[1]));
printf(“%d\n”, sizeof(&arr));
printf(“%d\n”, sizeof(&arr+1));
printf(“%d\n”, sizeof(&arr[0]+1));
printf(“%d\n”, strlen(arr));
printf(“%d\n”, strlen(arr+0));
printf(“%d\n”, strlen(*arr));
printf(“%d\n”, strlen(arr[1]));
printf(“%d\n”, strlen(&arr));
printf(“%d\n”, strlen(&arr+1));
printf(“%d\n”, strlen(&arr[0]+1));
char *p = “abcdef”;
printf(“%d\n”, sizeof§);
printf(“%d\n”, sizeof(p+1));
printf(“%d\n”, sizeof(*p));
printf(“%d\n”, sizeof(p[0]));
printf(“%d\n”, sizeof(&p));
printf(“%d\n”, sizeof(&p+1));
printf(“%d\n”, sizeof(&p[0]+1));
printf(“%d\n”, strlen§);
printf(“%d\n”, strlen(p+1));
printf(“%d\n”, strlen(*p));
printf(“%d\n”, strlen(p[0]));
printf(“%d\n”, strlen(&p));
printf(“%d\n”, strlen(&p+1));
printf(“%d\n”, strlen(&p[0]+1));
1.3 二维数组
int a[3][4] = {0};
printf( “%d\n”,sizeof(a) );
printf( “%d\n",sizeof(a[0][0]) );
printf( “%d\n”,sizeof(a[0]) );
printf( ”%d\n",sizeof(a[0]+1) );
printf( “%d\n”,sizeof(* (a[0]+1)) );
printf( “%d\n”,sizeof(a+1) );
printf( “%d\n”,sizeof(* ( a+1) ) );
printf( “%d\n”,sizeof(&a[0]+1) );
printf( “%d\n”,sizeof( * (&a[0]+1) ) );
printf( “%d\n”,sizeof(*a) );
printf( “%d\n”,sizeof(a[3]) );
- 指针笔试题
int main()
{
int a[5] = { 1, 2, 3, 4, 5 };
int *ptr = (int *)(&a + 1);
printf( “%d,%d”, *(a + 1), *(ptr - 1));
return 0;
}
//程序的结果是什么?
//由于还没学习结构体,这里告知结构体的大小是20个字节
struct Test
{
int Num;
char *pcName;
short sDate;
char cha[2];
short sBa[4];
}*p;
//假设p 的值为0x100000。 如下表表达式的值分别为多少?
//已知,结构体Test类型的变量大小是20个字节
int main()
{
printf(“%p\n”, p + 0x1);
printf(“%p\n”, ( unsigned long )p + 0x1);
printf(“%p\n”, (unsigned int * )p + 0x1);
return 0;
}
int main()
{
int a[4] = { 1, 2, 3, 4 };
int *ptr1 = (int *)(&a + 1);
int *ptr2 = (int *)((int)a + 1);
printf( “%x,%x”, ptr1[-1], *ptr2);
return 0;
}
#include <stdio.h>
int main()
{
int a[3][2] = { (0, 1), (2, 3), (4, 5) };
int *p;
p = a[0];
printf( “%d”, p[0]);
return 0;
}
int main()
{
int a[5][5];
int(*p)[4];
p = a;
printf( “%p,%d\n”, &p[4][2] - &a[4][2], &p[4][2] - &a[4][2]);
return 0;
}
int main()
{
int aa[2][5] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int *ptr1 = (int *)(&aa + 1);
int *ptr2 = (int * )( * (aa + 1) );
printf( “%d,%d”, * (ptr1 - 1), *(ptr2 - 1) );
return 0;
}
#include <stdio.h>
int main()
{
char *a[] = {“work”,“at”,“alibaba”};
char**pa = a;
pa++;
printf(“%s\n”, *pa);
return 0;
}
int main()
{
char * c[ ] = {“ENTER”,“NEW”,“POINT”,“FIRST”};
char ** cp[] = {c+3,c+2,c+1,c};
char *** cpp = cp;
printf(“%s\n”, ** ++cpp);
printf(“%s\n”, * --* ++cpp+3);
printf(“%s\n”, * cpp[-2]+3);
printf(“%s\n”, cpp[-1][-1]+1);
return 0;
}
总结
指针的博客就告一段落了,敬请期待后面的博客吧!!!
边栏推荐
- APT + Transform to realize multi module Application distributed Application life cycle
- Smart people's game improvement: Chapter 3, Lesson 2: "Number of Tongtong" (number)
- kubernetes affinity, anti-affinity, taint, tolerance
- The installation of NPM, CNPM
- How to install the specified version package with NPM and view the version number
- [C language] LeetCode26. Delete duplicates in an ordered array && LeetCode88. Merge two ordered arrays
- 驱动页面性能优化的3个有效策略
- 双重for循环案例(用js打印九九乘法表)
- leetcode一步解决链表反转问题
- 关于鸿蒙系统 JS UI 框架源码的分析
猜你喜欢

node安装和配置(node-v12.20.2-x64 ) 以及node版本切换介绍

Polar Parametrization for Vision-based Surround-View 3D Detection Paper Notes

Guarantee WIFI security in home and enterprise-with AC and AP networking experiment

Introduction to coredns

科技赋能拉萨之“肺”,华为助力拉鲁湿地智慧管理守护绿水青山

leetcode solves the linked list merge problem in one step

Linux CentOS8安装Redis6

腾讯大咖分享 | 腾讯Alluxio(DOP)在金融场景的落地与优化实践

Analysis of port 9848 error at startup of Nacos client (non-version upgrade problem)

How to install the specified version package with NPM and view the version number
随机推荐
蚂蚁三面:MQ 消息丢失、重复、积压问题,有哪些解决方案?
Tips for programmers to write PPT
Deep learning - CNN realizes the recognition of MNIST handwritten digits
深度学习——CNN实现MNIST手写数字的识别
Double for loop case (use js jiujiu printing multiplication table)
Polar Parametrization for Vision-based Surround-View 3D Detection Paper Notes
Alluxio为Presto赋能跨云的自助服务能力
Luogu mini game Daquan (everyone who uses Luogu must know)
C language entry combat (13): decimal number to binary
虚拟现实房产展示系统提前预见未来装修效果
Write implicit join on view with jOOQ 3.14 synthetic foreign key
Constructors, member variables, local variables
面试官:设计“抖音”直播功能测试用例吧
金蝶国际:半年亏掉去年一年,疯狂烧钱的商业模式如何持续
Point Density-Aware Voxels for LiDAR 3D Object Detection 论文笔记
Say good woman programmers do testing have an advantage?More than a dozen interview, abuse of cry ~ ~ by the interviewer
淘系资深工程师整理的300+项学习资源清单(2021最新版)
如何进行并发数计算(稳定性测试和压力测试)?
Redis(十一) - 异步优化秒杀
【合集- 行业解决方案】如何搭建高性能的数据加速与数据编排平台