Simple java code || 1ms || beats 95.68
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] getConcatenation(int[] nums) {\n        int[] ans = new int[2 * nums.length];\n        for(int i = 0; i < nums.length; i++){\n            ans[i] = ans[i + nums.length] = nums[i];\n        }\n        \n        return ans;\n    }\n}\n```
['Java']