Skip to content

Commit bb3e46f

Browse files
authored
feat: add swift implementation to lcof2 problem: No.012 (doocs#2982)
1 parent 21520c1 commit bb3e46f

File tree

2 files changed

+35
-0
lines changed

2 files changed

+35
-0
lines changed

lcof2/剑指 Offer II 012. 左右两边子数组的和相等/README.md

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -226,6 +226,26 @@ int pivotIndex(int* nums, int numsSize) {
226226
}
227227
```
228228
229+
#### Swift
230+
231+
```swift
232+
class Solution {
233+
func pivotIndex(_ nums: [Int]) -> Int {
234+
var leftSum = 0
235+
var rightSum = nums.reduce(0, +)
236+
237+
for i in 0..<nums.count {
238+
rightSum -= nums[i]
239+
if leftSum == rightSum {
240+
return i
241+
}
242+
leftSum += nums[i]
243+
}
244+
return -1
245+
}
246+
}
247+
```
248+
229249
<!-- tabs:end -->
230250

231251
<!-- solution:end -->
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
class Solution {
2+
func pivotIndex(_ nums: [Int]) -> Int {
3+
var leftSum = 0
4+
var rightSum = nums.reduce(0, +)
5+
6+
for i in 0..<nums.count {
7+
rightSum -= nums[i]
8+
if leftSum == rightSum {
9+
return i
10+
}
11+
leftSum += nums[i]
12+
}
13+
return -1
14+
}
15+
}

0 commit comments

Comments
 (0)