Ahm*_*d F 8 arrays algorithm higher-order-functions swift
考虑以下2D数组:
let array = [
[11, 2, 4],
[4, 5, 6],
[10, 8, -12]
]
Run Code Online (Sandbox Code Playgroud)
我想得到的是对角线的总和:
firstDiagnal:11 + 5 +( - 12)= 4secondDiagnal:4 + 5 + 10 = 19我可以使用标准for-in循环来实现它:
var firstDiagnal = 0
var secondDiagnal = 0
for i in 0..<array.count {
firstDiagnal += array[i][i]
secondDiagnal += array[i][array[i].count - 1 - i]
}
print(firstDiagnal)
print(secondDiagnal)
Run Code Online (Sandbox Code Playgroud)
但是,如果我们尝试使用高阶函数会是什么呢?如map和reduce?
要获得第一笔总和,您需要第i行的第i个元素:
let firstDiag = array.enumerated().map { $1[$0] }.reduce(0, +)
Run Code Online (Sandbox Code Playgroud)
要获得第二笔金额,您需要相同的东西,但列相反:
let secondDiag = array.enumerated().map { $1.reversed()[$0] }.reduce(0, +)
Run Code Online (Sandbox Code Playgroud)