update readme

Author: hogan-tech

0088-merge-sorted-array/0088-merge-sorted-array.py

@@ -5,19 +5,18 @@
 
 class Solution:
     def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
-        p1 = m - 1
-        p2 = n - 1
-        for p in range(m + n - 1, -1, -1):
-            if p2 < 0:
-                break
-            if p1 >= 0 and nums1[p1] > nums2[p2]:
-                nums1[p] = nums1[p1]
-                p1 -= 1
-            else:
-                nums1[p] = nums2[p2]
-                p2 -= 1
+        idx1 = m - 1
+        idx2 = n - 1
+        currIdx = m + n - 1
 
-        return nums1
+        while idx2 >= 0:
+            if idx1 >= 0 and nums1[idx1] > nums2[idx2]:
+                nums1[currIdx] = nums1[idx1]
+                idx1 -= 1
+            else:
+                nums1[currIdx] = nums2[idx2]
+                idx2 -= 1
+            currIdx -= 1
 
 
 nums1 = [1, 2, 3, 0, 0, 0]

0088-merge-sorted-array/README.md

@@ -115,19 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [0088-merge-sorted-array](https://github.com/hogan-tech/leetcode-solution/tree/master/0088-merge-sorted-array) |
-## Two Pointers
-|  |
-| ------- |
-| [0088-merge-sorted-array](https://github.com/hogan-tech/leetcode-solution/tree/master/0088-merge-sorted-array) |
-## Sorting
-|  |
-| ------- |
-| [0088-merge-sorted-array](https://github.com/hogan-tech/leetcode-solution/tree/master/0088-merge-sorted-array) |
-<!---LeetCode Topics End-->

Python/0088-merge-sorted-array.py

@@ -1,5 +1,4 @@
-<h2> 16022 2155
-88. Merge Sorted Array</h2><hr><div><p>You are given two integer arrays <code>nums1</code> and <code>nums2</code>, sorted in <strong>non-decreasing order</strong>, and two integers <code>m</code> and <code>n</code>, representing the number of elements in <code>nums1</code> and <code>nums2</code> respectively.</p>
+<h2><a href="https://leetcode.com/problems/merge-sorted-array">88. Merge Sorted Array</a></h2><h3>Easy</h3><hr><p>You are given two integer arrays <code>nums1</code> and <code>nums2</code>, sorted in <strong>non-decreasing order</strong>, and two integers <code>m</code> and <code>n</code>, representing the number of elements in <code>nums1</code> and <code>nums2</code> respectively.</p>
 
 <p><strong>Merge</strong> <code>nums1</code> and <code>nums2</code> into a single array sorted in <strong>non-decreasing order</strong>.</p>
 
@@ -8,23 +7,26 @@
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre><strong>Input:</strong> nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
+<pre>
+<strong>Input:</strong> nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
 <strong>Output:</strong> [1,2,2,3,5,6]
 <strong>Explanation:</strong> The arrays we are merging are [1,2,3] and [2,5,6].
 The result of the merge is [<u>1</u>,<u>2</u>,2,<u>3</u>,5,6] with the underlined elements coming from nums1.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre><strong>Input:</strong> nums1 = [1], m = 1, nums2 = [], n = 0
+<pre>
+<strong>Input:</strong> nums1 = [1], m = 1, nums2 = [], n = 0
 <strong>Output:</strong> [1]
 <strong>Explanation:</strong> The arrays we are merging are [1] and [].
 The result of the merge is [1].
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre><strong>Input:</strong> nums1 = [0], m = 0, nums2 = [1], n = 1
+<pre>
+<strong>Input:</strong> nums1 = [0], m = 0, nums2 = [1], n = 1
 <strong>Output:</strong> [1]
 <strong>Explanation:</strong> The arrays we are merging are [] and [1].
 The result of the merge is [1].
@@ -44,4 +46,3 @@ Note that because m = 0, there are no elements in nums1. The 0 is only there to
 
 <p>&nbsp;</p>
 <p><strong>Follow up: </strong>Can you come up with an algorithm that runs in <code>O(m + n)</code> time?</p>
-</div>