c++数组遍历十种方式
2024-10-21 16:37:19
int ia[3][4] = {1,2,3,4,5,6,7,8};
//下标
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 4; j++)
{
cout << ia[i][j] << endl;
}
}
//指针
for (int(*p)[4] = ia; p != ia + 3; p++)
{
for (int *q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//指针,迭代
for (int(*p)[4] = begin(ia); p != end(ia); p++)
{
for (int* q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//范围for
for (int (&p)[4] : ia)
{
for (int q : p)
{
cout << q << endl;
}
}
//下标
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 4; j++)
{
cout << ia[i][j] << endl;
}
}
//指针
for (int(*p)[4] = ia; p != ia + 3; p++)
{
for (int *q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//指针,迭代
for (int(*p)[4] = begin(ia); p != end(ia); p++)
{
for (int* q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//范围for
for (int (&p)[4] : ia)
{
for (int q : p)
{
cout << q << endl;
}
}
typedef int int_array[4];
//类别名+指针
for (int_array* p = ia; p != ia + 3; p++)
{
for (int* q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//类别名+迭代
for (int_array *p = begin(ia); p != end(ia); p++)
{
for (int* q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//类别名+范围for
for (int_array &p : ia)
{
for (int q : p)
{
cout << q << endl;
}
}
//auto
for (auto p = ia; p != ia + 3; p++)
{
for (auto q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//auto+迭代
for (auto p = begin(ia); p != end(ia); p++)
{
for (auto q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//auto+范围for
for (auto &p : ia)
{
for (auto q : p)
{
cout << q << endl;
}
}
//类别名+指针
for (int_array* p = ia; p != ia + 3; p++)
{
for (int* q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//类别名+迭代
for (int_array *p = begin(ia); p != end(ia); p++)
{
for (int* q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//类别名+范围for
for (int_array &p : ia)
{
for (int q : p)
{
cout << q << endl;
}
}
//auto
for (auto p = ia; p != ia + 3; p++)
{
for (auto q = *p; q != *p + 4; q++)
{
cout << *q << endl;
}
}
//auto+迭代
for (auto p = begin(ia); p != end(ia); p++)
{
for (auto q = begin(*p); q != end(*p); q++)
{
cout << *q << endl;
}
}
//auto+范围for
for (auto &p : ia)
{
for (auto q : p)
{
cout << q << endl;
}
}
最新文章
- 梯度下降(Gradient Descent)小结
- git上传到阿里云code
- android PopupWindow使用实例
- Bash实用技巧:同时循环两个列表
- ubuntu安装jdk-6u45-linux-x64-rpm.bin
- 各个公司的来源/The etymology of company
- python string 文本常量和模版
- 退出手机QQ依旧显示在线
- label不换行的问题
- 201521123033《Java程序设计》第11周学习总结
- Java数组的一些使用方法及堆栈存储
- To making it count.
- Java异常处理 10 个最佳实践
- textarea 带换行符保存数据与带换行符展示数据
- WEBPAKC2.0开始
- .Net框架搭建:SQL Server EF MVC简单三层框架
- Hadoop生态圈-Hive函数
- 20162314 Experiment 4 - Graph
- [Grunt] External Config
- 深入理解JavaScript系列(44):设计模式之桥接模式