数组的遍历
2016-06-07 22:33
363 查看
//
// main.c
// 数组的遍历
//
// Created by Jason on 16/6/7.
// Copyright © 2016年 Jason. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char * argv[]) {
//数组的遍历
int scorce[3] = {10,11,12};
for (int i = 0; i < 3; i++) {
printf("%d \n" , scorce[i]);
}
//部分静态初始化
int scoress[30] = {10};
for (int j = 0; j < 30; j++) {
printf("scoress[%d] = %d \n",j,scoress[j]);
}
//部分动态初始化 没有被初始化的元素中 是有值得 是垃圾值
int scoresss[30];
scoresss[0] = 10;
scoresss[1] = 11;
for (int k = 0; k < 30; k++) {
printf("scoresss[%d] = %d \n",k,scoresss[k]);
}
//假设有数组
int a[10] = {1,2,3,4,5,6,7,8,9,0};
//1.正序输出
for (int i = 0; i < 10; i++) {
printf("%d \n",a[i]);
}
int b[10] = {1,2,3,4,5,6,7,8,9,0};
//1.逆序输出
for (int i = 9;i >= 0; i--) {
printf("%d \n" ,b[i]);
}
return 0;
}
// main.c
// 数组的遍历
//
// Created by Jason on 16/6/7.
// Copyright © 2016年 Jason. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char * argv[]) {
//数组的遍历
int scorce[3] = {10,11,12};
for (int i = 0; i < 3; i++) {
printf("%d \n" , scorce[i]);
}
//部分静态初始化
int scoress[30] = {10};
for (int j = 0; j < 30; j++) {
printf("scoress[%d] = %d \n",j,scoress[j]);
}
//部分动态初始化 没有被初始化的元素中 是有值得 是垃圾值
int scoresss[30];
scoresss[0] = 10;
scoresss[1] = 11;
for (int k = 0; k < 30; k++) {
printf("scoresss[%d] = %d \n",k,scoresss[k]);
}
//假设有数组
int a[10] = {1,2,3,4,5,6,7,8,9,0};
//1.正序输出
for (int i = 0; i < 10; i++) {
printf("%d \n",a[i]);
}
int b[10] = {1,2,3,4,5,6,7,8,9,0};
//1.逆序输出
for (int i = 9;i >= 0; i--) {
printf("%d \n" ,b[i]);
}
return 0;
}
相关文章推荐
- poj 2524 并查集入门
- 移动h5自适应布局
- skydns+etcd域名服务压测
- Unicode编码转汉字
- TDOA的定位
- 文章标题
- Java的字符串String
- SrpingMVC 文件上传容易遇到的问题
- 菜鸟笔记-面向对象
- "选择排序"算法-之通俗易懂原理讲解-java编程
- 班级信息的学生类
- SGU 210. Beloved Sons(二分图匹配)
- Bootstrap 学习之js插件(折叠(collapse)插件)
- 调试报“The source file is different from when the module was built.”问题的解决
- Archetype creation(maven创建模板)
- 判断是否为PE文件改进版
- Swift和Java关于字符串和字符的比较
- 将连接MySQL数据库的java项目程序打包成为.jar格式
- SQL case when
- 3、用私有构造器或者枚举类型强化SIngleton属性