✅ Easiest Solution [C++] with 0ms ✅ || Beats 100% of solutions
Approach\nExtremely simple solution, take the vector given and use the insert function starting from the end of the vector, inserting a copy of itself past the 
# Approach\nExtremely simple solution, take the vector given and use the insert function starting from the end of the vector, inserting a copy of itself past the end.\nthen return the vector.\n\n# Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> getConcatenation(vector<int>& nums) {\n        nums.insert(nums.end(),nums.begin(),nums.end());\n        return nums;\n    }\n};\n```
['Array', 'Two Pointers', 'Iterator', 'C++']