My LeetCode grinding. Trying to do a problem a day.
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

1234567891011121314151617181920212223
  1. #include <vector>
  2. #include <iostream>
  3. #include <algorithm>
  4. void merge(std::vector<int>& nums1, int m, std::vector<int>& nums2, int n) {
  5. while (n > 0) {
  6. nums1[m++] = nums2[--n];
  7. }
  8. std::sort(nums1.begin(), nums1.end());
  9. }
  10. int main() {
  11. std::cout << "Expected: [1, 2, 2, 3, 5, 6]" << std::endl;
  12. std::vector<int> n1 = {1, 2, 3, 0, 0, 0};
  13. std::vector<int> n2 = {2, 5, 6};
  14. merge(n1, 3, n2, 3);
  15. std::cout << "Got: [ ";
  16. for (int i = 0; i < 6; i++) {
  17. std::cout << n1[i] << " ";
  18. }
  19. std::cout << " ]" << std::endl;
  20. return 0;
  21. }