mirror of https://github.com/doocs/leetcode.git
feat: add swift implementation to lcof problem: No.53.2 (#2939)
This commit is contained in:
parent
0fdbff266f
commit
98aad3742e
|
|
@ -181,6 +181,27 @@ public class Solution {
|
|||
}
|
||||
```
|
||||
|
||||
#### Swift
|
||||
|
||||
```swift
|
||||
class Solution {
|
||||
func missingNumber(_ nums: [Int]) -> Int {
|
||||
var left = 0
|
||||
var right = nums.count
|
||||
|
||||
while left < right {
|
||||
let mid = (left + right) / 2
|
||||
if nums[mid] > mid {
|
||||
right = mid
|
||||
} else {
|
||||
left = mid + 1
|
||||
}
|
||||
}
|
||||
return left
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
<!-- tabs:end -->
|
||||
|
||||
<!-- solution:end -->
|
||||
|
|
|
|||
|
|
@ -0,0 +1,16 @@
|
|||
class Solution {
|
||||
func missingNumber(_ nums: [Int]) -> Int {
|
||||
var left = 0
|
||||
var right = nums.count
|
||||
|
||||
while left < right {
|
||||
let mid = (left + right) / 2
|
||||
if nums[mid] > mid {
|
||||
right = mid
|
||||
} else {
|
||||
left = mid + 1
|
||||
}
|
||||
}
|
||||
return left
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue