xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-09-01 04:47:12 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix multilingual content typos (#1958)

Browse Source
This commit is contained in:
Yudong Jin
2026-08-18 03:08:23 +08:00
committed by GitHub
parent 69932aed18
commit bf86c39b6c
201 changed files with 289 additions and 271 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/codes/swift/chapter_searching/binary_search_insertion.swift
+1 -1
View File
@@ -35,7 +35,7 @@ public func binarySearchInsertion(nums: [Int], target: Int) -> Int {
} else if nums[m] > target {
j = m - 1 // target is in the interval [i, m-1]
} else {
j = m - 1 // The first element less than target is in the interval [i, m-1]
j = m - 1 // The rightmost element less than target is in the interval [i, m-1]
}
}
// Return insertion point i
en/codes/swift/chapter_searching/binary_search_insertion_target.swift
+1 -1
View File
@@ -35,7 +35,7 @@ public func binarySearchInsertion(nums: [Int], target: Int) -> Int {
} else if nums[m] > target {
j = m - 1 // target is in the interval [i, m-1]
} else {
j = m - 1 // The first element less than target is in the interval [i, m-1]
j = m - 1 // The rightmost element less than target is in the interval [i, m-1]
}
}
// Return insertion point i
en/codes/swift/chapter_stack_and_queue/queue.swift
+2 -2
View File
@@ -26,8 +26,8 @@ enum Queue {
/* Element dequeue */
// When simulating with Array, pop complexity is O(n)
let pool = queue.removeFirst()
print("Dequeue element pop = \(pool), after dequeue queue = \(queue)")
let pop = queue.removeFirst()
print("Dequeue element pop = \(pop), after dequeue queue = \(queue)")
/* Get the length of the queue */
let size = queue.count