leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0088.cpp (322B)

0 class Solution { 1 public: 2 void merge(vector<int> &nums1, int m, vector<int> &nums2, int n) { 3 int i = m - 1, j = n - 1, k = m + n - 1; 4 5 while (i >= 0 && j >= 0) 6 nums1[k--] = nums1[i] > nums2[j] ? nums1[i--] : nums2[j--]; 7 while (j >= 0) 8 nums1[k--] = nums2[j--]; 9 } 10 };