C语言循环嵌套实战技巧

循环嵌套的基本概念

循环嵌套是指在循环体内包含另一个循环结构。外层循环每执行一次,内层循环会完整执行一轮。C语言支持forwhiledo-while三种循环的任意组合嵌套。

常见嵌套形式:

  • for嵌套for
  • while嵌套for
  • do-while嵌套while

打印图形类练习

直角三角形示例

for(int i=1; i<=5; i++) {
    for(int j=1; j<=i; j++) {
        printf("*");
    }
    printf("\n");
}

输出:

*
**
***
****
*****

空心矩形示例

int rows=4, cols=10;
for(int i=1; i<=rows; i++) {
    for(int j=1; j<=cols; j++) {
        if(i==1 || i==rows || j==1 || j==cols)
            printf("#");
        else
            printf(" ");
    }
    printf("\n");
}

数学计算类练习

九九乘法表

for(int i=1; i<=9; i++) {
    for(int j=1; j<=i; j++) {
        printf("%d×%d=%-2d ", j, i, i*j);
    }
    printf("\n");
}

素数判断

for(int num=2; num<=100; num++) {
    int is_prime = 1;
    for(int i=2; i*i<=num; i++) {
        if(num%i == 0) {
            is_prime = 0;
            break;
        }
    }
    if(is_prime) printf("%d ", num);
}

数组处理类练习

矩阵转置

int matrix[3][3] = {{1,2,3},{4,5,6},{7,8,9}};
for(int i=0; i<3; i++) {
    for(int j=i+1; j<3; j++) {
        int temp = matrix[i][j];
        matrix[i][j] = matrix[j][i];
        matrix[j][i] = temp;
    }
}

二维数组求和

int arr[4][5], sum=0;
for(int i=0; i<4; i++) {
    for(int j=0; j<5; j++) {
        sum += arr[i][j];
    }
}

特殊模式类练习

数字金字塔

for(int i=1; i<=5; i++) {
    for(int space=5; space>i; space--) {
        printf(" ");
    }
    for(int j=1; j<=2*i-1; j++) {
        printf("%d", i);
    }
    printf("\n");
}

字母菱形

char ch='A';
for(int i=1; i<=5; i++) {
    for(int space=5; space>i; space--) {
        printf(" ");
    }
    for(int j=1; j<=i; j++) {
        printf("%c", ch++);
    }
    ch--;
    for(int k=1; k<i; k++) {
        printf("%c", --ch);
    }
    printf("\n");
    ch='A';
}

调试技巧

  1. 使用临时变量打印循环计数器:
printf("i=%d, j=%d\n", i, j);
  1. 缩小数据规模测试,如将循环上限从100改为5。

  2. 添加条件断点调试嵌套循环。

性能优化建议

  1. 尽量减少内层循环的计算量,将可预先计算的表达式移到外层。

  2. 避免在循环嵌套中进行重复判断,合理使用breakcontinue

  3. 对于多层嵌套,考虑是否能用数学公式替代部分循环。

  4. 数组处理时注意内存访问的局部性原理。

BbS.okacop030.info/PoSt/1120_742546.HtM
BbS.okacop031.info/PoSt/1120_058664.HtM
BbS.okacop032.info/PoSt/1120_116508.HtM
BbS.okacop033.info/PoSt/1120_640089.HtM
BbS.okacop034.info/PoSt/1120_725320.HtM
BbS.okacop035.info/PoSt/1120_721549.HtM
BbS.okacop036.info/PoSt/1120_827151.HtM
BbS.okacop037.info/PoSt/1120_682785.HtM
BbS.okacop038.info/PoSt/1120_261354.HtM
BbS.okacop039.info/PoSt/1120_558086.HtM
BbS.okacop030.info/PoSt/1120_378687.HtM
BbS.okacop031.info/PoSt/1120_176205.HtM
BbS.okacop032.info/PoSt/1120_323750.HtM
BbS.okacop033.info/PoSt/1120_226674.HtM
BbS.okacop034.info/PoSt/1120_498876.HtM
BbS.okacop035.info/PoSt/1120_884078.HtM
BbS.okacop036.info/PoSt/1120_479347.HtM
BbS.okacop037.info/PoSt/1120_358601.HtM
BbS.okacop038.info/PoSt/1120_026226.HtM
BbS.okacop039.info/PoSt/1120_749630.HtM
BbS.okacop030.info/PoSt/1120_141974.HtM
BbS.okacop031.info/PoSt/1120_483845.HtM
BbS.okacop032.info/PoSt/1120_393743.HtM
BbS.okacop033.info/PoSt/1120_203487.HtM
BbS.okacop034.info/PoSt/1120_558187.HtM
BbS.okacop035.info/PoSt/1120_333187.HtM
BbS.okacop036.info/PoSt/1120_428868.HtM
BbS.okacop037.info/PoSt/1120_781721.HtM
BbS.okacop038.info/PoSt/1120_005820.HtM
BbS.okacop039.info/PoSt/1120_553472.HtM
BbS.okacop030.info/PoSt/1120_869588.HtM
BbS.okacop031.info/PoSt/1120_848125.HtM
BbS.okacop032.info/PoSt/1120_339282.HtM
BbS.okacop033.info/PoSt/1120_576949.HtM
BbS.okacop034.info/PoSt/1120_634324.HtM
BbS.okacop035.info/PoSt/1120_060060.HtM
BbS.okacop036.info/PoSt/1120_191158.HtM
BbS.okacop037.info/PoSt/1120_462203.HtM
BbS.okacop038.info/PoSt/1120_573049.HtM
BbS.okacop039.info/PoSt/1120_983511.HtM
BbS.okacop030.info/PoSt/1120_287961.HtM
BbS.okacop031.info/PoSt/1120_277503.HtM
BbS.okacop032.info/PoSt/1120_763583.HtM
BbS.okacop033.info/PoSt/1120_570762.HtM
BbS.okacop034.info/PoSt/1120_793015.HtM
BbS.okacop035.info/PoSt/1120_968701.HtM
BbS.okacop036.info/PoSt/1120_489616.HtM
BbS.okacop037.info/PoSt/1120_047729.HtM
BbS.okacop038.info/PoSt/1120_797630.HtM
BbS.okacop039.info/PoSt/1120_790677.HtM
BbS.okacop040.info/PoSt/1120_169712.HtM
BbS.okacop041.info/PoSt/1120_377479.HtM
BbS.okacop042.info/PoSt/1120_211118.HtM
BbS.okacop043.info/PoSt/1120_342584.HtM
BbS.okacop044.info/PoSt/1120_773737.HtM
BbS.okacop045.info/PoSt/1120_360210.HtM
BbS.okacop046.info/PoSt/1120_908438.HtM
BbS.okacop047.info/PoSt/1120_864212.HtM
BbS.okacop048.info/PoSt/1120_204254.HtM
BbS.okacop049.info/PoSt/1120_972876.HtM
BbS.okacop040.info/PoSt/1120_478126.HtM
BbS.okacop041.info/PoSt/1120_870922.HtM
BbS.okacop042.info/PoSt/1120_498732.HtM
BbS.okacop043.info/PoSt/1120_798681.HtM
BbS.okacop044.info/PoSt/1120_696402.HtM
BbS.okacop045.info/PoSt/1120_566354.HtM
BbS.okacop046.info/PoSt/1120_589846.HtM
BbS.okacop047.info/PoSt/1120_043292.HtM
BbS.okacop048.info/PoSt/1120_646215.HtM
BbS.okacop049.info/PoSt/1120_870165.HtM
BbS.okacop040.info/PoSt/1120_257937.HtM
BbS.okacop041.info/PoSt/1120_318327.HtM
BbS.okacop042.info/PoSt/1120_231800.HtM
BbS.okacop043.info/PoSt/1120_711793.HtM
BbS.okacop044.info/PoSt/1120_029353.HtM
BbS.okacop045.info/PoSt/1120_089407.HtM
BbS.okacop046.info/PoSt/1120_928957.HtM
BbS.okacop047.info/PoSt/1120_031814.HtM
BbS.okacop048.info/PoSt/1120_952562.HtM
BbS.okacop049.info/PoSt/1120_409475.HtM

#牛客AI配图神器#

全部评论

相关推荐

给个offer灞:校友 是不是金die
点赞 评论 收藏
分享
09-24 18:30
已编辑
长春工业大学 产品经理
小肥罗:HR就是好人的缩写哈哈哈哈
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务