commit a9d7373732ee79b02516db3be3d9a48ad63ada94 Author: Kaushik Narayan R Date: Tue Sep 26 23:12:56 2023 -0700 starting out: 88-merge-sorted-array diff --git a/88-merge-sorted-array/soln.cpp b/88-merge-sorted-array/soln.cpp new file mode 100644 index 0000000..272cd13 --- /dev/null +++ b/88-merge-sorted-array/soln.cpp @@ -0,0 +1,39 @@ +#include +#include +#include + +using std::vector; + +class Solution +{ +public: + void merge(vector &nums1, int m, vector &nums2, int n) + { + int arr1_p = 0, arr2_p = 0; + vector result = vector(m + n); + for (int i = 0; i < m + n; i++) + { + // second array depleted + if (arr2_p >= n) + { + result[i] = nums1[arr1_p++]; + } + // first array depleted + else if (arr1_p >= m) + { + result[i] = nums2[arr2_p++]; + } + // nums2 elem greater, take from nums1 + else if (nums2[arr2_p] > nums1[arr1_p]) + { + result[i] = nums1[arr1_p++]; + } + // nums1 elem greater, take from nums2 + else if (nums2[arr2_p] <= nums1[arr1_p]) + { + result[i] = nums2[arr2_p++]; + } + } + nums1 = result; + } +}; \ No newline at end of file diff --git a/README.md b/README.md new file mode 100644 index 0000000..1c94b5e --- /dev/null +++ b/README.md @@ -0,0 +1,4 @@ +# leetcode-gulag: self-coerced doses of daily leetcode + +- My work on various Leetcode problems +- Shoutout to [leetcode-torture](https://github.com/The-CodingSloth/haha-funny-leetcode-extension) for making me commit to this diff --git a/thoughts.md b/thoughts.md new file mode 100644 index 0000000..f715ffa --- /dev/null +++ b/thoughts.md @@ -0,0 +1,5 @@ +# misc. thoughts and maybe tips + +- libraries: + - essentials: bits/stdc++.h, iostream + - data structures: vector