mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-11-04 14:18:20 +08:00 
			
		
		
		
	* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
		
			
				
	
	
		
			76 lines
		
	
	
		
			1.5 KiB
		
	
	
	
		
			Swift
		
	
	
	
	
	
			
		
		
	
	
			76 lines
		
	
	
		
			1.5 KiB
		
	
	
	
		
			Swift
		
	
	
	
	
	
/**
 | 
						||
 * File: iteration.swift
 | 
						||
 * Created Time: 2023-09-02
 | 
						||
 * Author: nuomi1 (nuomi1@qq.com)
 | 
						||
 */
 | 
						||
 | 
						||
/* for 循环 */
 | 
						||
func forLoop(n: Int) -> Int {
 | 
						||
    var res = 0
 | 
						||
    // 循环求和 1, 2, ..., n-1, n
 | 
						||
    for i in 1 ... n {
 | 
						||
        res += i
 | 
						||
    }
 | 
						||
    return res
 | 
						||
}
 | 
						||
 | 
						||
/* while 循环 */
 | 
						||
func whileLoop(n: Int) -> Int {
 | 
						||
    var res = 0
 | 
						||
    var i = 1 // 初始化条件变量
 | 
						||
    // 循环求和 1, 2, ..., n-1, n
 | 
						||
    while i <= n {
 | 
						||
        res += i
 | 
						||
        i += 1 // 更新条件变量
 | 
						||
    }
 | 
						||
    return res
 | 
						||
}
 | 
						||
 | 
						||
/* while 循环(两次更新) */
 | 
						||
func whileLoopII(n: Int) -> Int {
 | 
						||
    var res = 0
 | 
						||
    var i = 1 // 初始化条件变量
 | 
						||
    // 循环求和 1, 4, 10, ...
 | 
						||
    while i <= n {
 | 
						||
        res += i
 | 
						||
        // 更新条件变量
 | 
						||
        i += 1
 | 
						||
        i *= 2
 | 
						||
    }
 | 
						||
    return res
 | 
						||
}
 | 
						||
 | 
						||
/* 双层 for 循环 */
 | 
						||
func nestedForLoop(n: Int) -> String {
 | 
						||
    var res = ""
 | 
						||
    // 循环 i = 1, 2, ..., n-1, n
 | 
						||
    for i in 1 ... n {
 | 
						||
        // 循环 j = 1, 2, ..., n-1, n
 | 
						||
        for j in 1 ... n {
 | 
						||
            res.append("(\(i), \(j)), ")
 | 
						||
        }
 | 
						||
    }
 | 
						||
    return res
 | 
						||
}
 | 
						||
 | 
						||
@main
 | 
						||
enum Iteration {
 | 
						||
    /* Driver Code */
 | 
						||
    static func main() {
 | 
						||
        let n = 5
 | 
						||
        var res = 0
 | 
						||
 | 
						||
        res = forLoop(n: n)
 | 
						||
        print("\nfor 循环的求和结果 res = \(res)")
 | 
						||
 | 
						||
        res = whileLoop(n: n)
 | 
						||
        print("\nwhile 循环的求和结果 res = \(res)")
 | 
						||
 | 
						||
        res = whileLoopII(n: n)
 | 
						||
        print("\nwhile 循环(两次更新)求和结果 res = \(res)")
 | 
						||
 | 
						||
        let resStr = nestedForLoop(n: n)
 | 
						||
        print("\n双层 for 循环的遍历结果 \(resStr)")
 | 
						||
    }
 | 
						||
}
 |