Simple C++ Solution  || 2 Lines|| 99%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nJust PUSHING nums eleme
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nJust PUSHING nums element again into nums vector and returning nums vector.\n\nPLEASE UPVOTE IF YOU LIKE THE SOLUTION .\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> getConcatenation(vector<int>& nums){\n        int n=nums.size();\n        for(int i=0;i<n;i++)\n            nums.push_back(nums[i]);\n        return nums;\n    }\n};\n```
['C++']