✅Java Simple Solution || ✅Runtime 0ms || ✅ Beats100%
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```Java\nclass Solution {\n    public int[] getConcatenation(int[] nums) {\n        int length = nums.length;\n        int output[] = new int[2*length];\n         \n        System.arraycopy(nums, 0, output, 0, length);\n        System.arraycopy(nums, 0, output, length, length);\n         \n        return output;\n    }\n}\n```\n\n## For additional problem-solving solutions, you can explore my repository on GitHub: [GitHub Repository](https://github.com/ahmedna126/java_leetcode_challenges)\n\n\n\n![e78315ef-8a9d-492b-9908-e3917f23eb31_1674946036.087042.jpeg](https://assets.leetcode.com/users/images/53903783-1992-4b9b-b1bb-2e70f72b6b57_1687953420.8129873.jpeg)\n
['Java']