LeetcodePractice/twoPointerExample.cpp at main · rakthuraga/LeetcodePractice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <iostream>
#include <vector>
std::vector<int> SortedCombine(std::vector<int>&,std::vector<int>& );
int main()
{
  std::vector<int> vector = {1,3,5,7,9};
  std::vector<int> vectorTwo = {2,4,6,8,10,11};

  std::vector<int> finalVector = SortedCombine(vector, vectorTwo);
  for(int i = 0; i < finalVector.size(); i++)
  {
    std::cout << finalVector[i];
  }
  std::cout << std::endl;
}

std::vector<int> SortedCombine(std::vector<int>& vecOne,std::vector<int>& vecTwo)
{
  int i = 0;
  int j = 0;

  std::vector<int> finalAnswer = {};

  while(i <= vecOne.size() - 1 && j <= vecTwo.size() - 1)
  {
    if(vecOne[i] < vecTwo[j])
    {
      finalAnswer.push_back(vecOne[i]);
      i++;
    }
    else if(vecOne[i] > vecTwo[j])
    {
      finalAnswer.push_back(vecTwo[j]);
      j++;
    }
    else
    {
      finalAnswer.push_back(vecOne[i]);
      i++;
    }

  }

  while(i < vecOne.size())
  {
    finalAnswer.push_back(vecOne[i]);
    i++;
  }

  while(j < vecTwo.size())
  {
    finalAnswer.push_back(vecTwo[j]);
    j++;
  }


  return finalAnswer;
}