mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 12:36:30 +08:00
f62256bee1
* Modify method name to PascalCase(array and linked list) * Modify method name to PascalCase(backtracking) * Modify method name to PascalCase(computational complexity) * Modify method name to PascalCase(divide and conquer) * Modify method name to PascalCase(dynamic programming) * Modify method name to PascalCase(graph) * Modify method name to PascalCase(greedy) * Modify method name to PascalCase(hashing) * Modify method name to PascalCase(heap) * Modify method name to PascalCase(searching) * Modify method name to PascalCase(sorting) * Modify method name to PascalCase(stack and queue) * Modify method name to PascalCase(tree) * local check
77 lines
1.9 KiB
C#
77 lines
1.9 KiB
C#
/**
|
|
* File: iteration.cs
|
|
* Created Time: 2023-08-28
|
|
* Author: hpstory (hpstory1024@163.com)
|
|
*/
|
|
|
|
namespace hello_algo.chapter_computational_complexity;
|
|
|
|
public class iteration {
|
|
/* for 循环 */
|
|
public static int ForLoop(int n) {
|
|
int res = 0;
|
|
// 循环求和 1, 2, ..., n-1, n
|
|
for (int i = 1; i <= n; i++) {
|
|
res += i;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* while 循环 */
|
|
public static int WhileLoop(int n) {
|
|
int res = 0;
|
|
int i = 1; // 初始化条件变量
|
|
// 循环求和 1, 2, ..., n-1, n
|
|
while (i <= n) {
|
|
res += i;
|
|
i += 1; // 更新条件变量
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* while 循环(两次更新) */
|
|
public static int WhileLoopII(int n) {
|
|
int res = 0;
|
|
int i = 1; // 初始化条件变量
|
|
// 循环求和 1, 2, 4, 5...
|
|
while (i <= n) {
|
|
res += i;
|
|
// 更新条件变量
|
|
i += 1;
|
|
i *= 2;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* 双层 for 循环 */
|
|
public static string NestedForLoop(int n) {
|
|
StringBuilder res = new();
|
|
// 循环 i = 1, 2, ..., n-1, n
|
|
for (int i = 1; i <= n; i++) {
|
|
// 循环 j = 1, 2, ..., n-1, n
|
|
for (int j = 1; j <= n; j++) {
|
|
res.Append($"({i}, {j}), ");
|
|
}
|
|
}
|
|
return res.ToString();
|
|
}
|
|
|
|
/* Driver Code */
|
|
[Test]
|
|
public void Test() {
|
|
int n = 5;
|
|
int res;
|
|
|
|
res = ForLoop(n);
|
|
Console.WriteLine("\nfor 循环的求和结果 res = " + res);
|
|
|
|
res = WhileLoop(n);
|
|
Console.WriteLine("\nwhile 循环的求和结果 res = " + res);
|
|
|
|
res = WhileLoopII(n);
|
|
Console.WriteLine("\nwhile 循环(两次更新)求和结果 res = " + res);
|
|
|
|
string resStr = NestedForLoop(n);
|
|
Console.WriteLine("\n双层 for 循环的遍历结果 " + resStr);
|
|
}
|
|
}
|