🚀🚀 Beats 100% | 4 Lines of Code | 0ms 🔥🔥
Complexity\n- Time complexity: O(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> getConcatenation(vector<int>& nums) {\n        int n = nums.size();\n\n        for(int i = 0; i < n; i++)\n        {\n            nums.push_back(nums[i]);\n        }\n\n        return nums;\n    }\n};\n```\n![lc1.png](https://assets.leetcode.com/users/images/5fd6e8b3-c7ff-4e68-a3ea-7029c3d19678_1706264939.3442893.png)\n
['Array', 'C', 'Simulation', 'Python', 'C++', 'Java', 'JavaScript']