Skip to content

feat: add swift implementation to lcof problem: No.11 #2858

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
May 20, 2024
Merged

feat: add swift implementation to lcof problem: No.11 #2858

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
23cfd82
Swift Implementation for LCOF 11
klever34 May 20, 2024
43fc08c
code update
klever34 May 20, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions lcof/面试题11. 旋转数组的最小数字/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -206,6 +206,28 @@ public class Solution {
}
```

#### Swift

```swift
class Solution {
func minArray(_ numbers: [Int]) -> Int {
var l = 0
var r = numbers.count - 1
while l < r {
let m = (l + r) / 2
if numbers[m] > numbers[r] {
l = m + 1
} else if numbers[m] < numbers[r] {
r = m
} else {
r -= 1
}
}
return numbers[l]
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
17 changes: 17 additions & 0 deletions lcof/面试题11. 旋转数组的最小数字/Solution.swift
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
class Solution {
func minArray(_ numbers: [Int]) -> Int {
var l = 0
var r = numbers.count - 1
while l < r {
let m = (l + r) / 2
if numbers[m] > numbers[r] {
l = m + 1
} else if numbers[m] < numbers[r] {
r = m
} else {
r -= 1
}
}
return numbers[l]
}
}