- [Codility] Lession 3.1 TapeEquil
- [Codility] Lession 5.2 CountDiv
- [Codility] Lession 2.1 CyclicRot
- [Codility] Lession 2.2 OddOccurr
- [Codility] Lession 3.3 PermMissi
- [Codility] Lession 3.2 FrogJmp
- [Codility] Lession 4.1 FrogRiver
- [Codility] Lession 4.2 PermCheck
- [Codility] Lession 4.3 MissingIn
- [Codility] Lession 1.1 Binary Ga
Swift Solution:
public func solution(inout A : [Int]) -> Int {
guard A.count > 0 else { return 0 }
var leftSum = A[0]
var rightSum = 0
var diff = [Int]()
for i in 1 ..< A.count { rightSum += A[i] }
for j in 1 ..< A.count {
let temp = abs(leftSum - rightSum)
leftSum += A[j]
rightSum -= A[j]
diff.append(temp)
}
var result = diff[0]
for x in 0 ..< diff.count {
if diff[x] < result { result = diff[x] }
}
return result
网友评论