Skip to content

Upload 88. Merge Sorted Array #9

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

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Upload 88. Merge Sorted Array #9

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
2ee68d4
Fix 88. Merge Sorted Array
VladimirCreator Nov 16, 2023
e32cb02
Update Readme with 88. Merge Sorted Array
VladimirCreator Nov 16, 2023
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
2 changes: 2 additions & 0 deletions Readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,8 @@
# LeetCode
## Table of Contents
1. Easy
1. 88\. Merge Sorted Array
- [Swift](/easy/swift/88.%20Merge%20Sorted%20Array)
1. 704\. Binary Search
- [Swift](./easy/swift/704_binary_search.swift)
1. Medium
Expand Down
23 changes: 23 additions & 0 deletions easy/swift/88. Merge Sorted Array
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
/* Initially Modified at 01:45 PM on Thu 16 Nov 2023
Copy link
Owner Author

@VladimirCreator VladimirCreator Nov 16, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Get rid of this line.

Last Modified at 01:53 PM on Thu 16 Nov 2023
Copy link
Owner Author

@VladimirCreator VladimirCreator Nov 16, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Get rid of this line.

Create upload-88-merge-sorted-array@github at 2:33 PM on Thu 16 Nov 2023.
Copy link
Owner Author

@VladimirCreator VladimirCreator Nov 16, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Get rid of this line.

*/
let numbers1: [Int] = [1, 2, 4] // sorted!
let numbers2: [Int] = [1, 1, 4] // sorted!
var numbers: [Int] = []

var i = 0, j = 0
while i < numbers1.count || j < numbers2.count {
if numbers1[i] == numbers2[j] || numbers1[i] < numbers2[j] {
numbers.append(numbers1[i])
numbers.append(numbers2[j])
}
else {
numbers.append(numbers2[j])
numbers.append(numbers1[i])
}

if i < numbers1.count { i += 1}; if j < numbers2.count { j += 1 }
}

print(numbers)