JAVA Easy solution || In single loop
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:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] getConcatenation(int[] nums) {\n        int n=nums.length;\n        int ans[]=new int[2*n];\n        for(int i=0;i<2*n;i++){\n            ans[i]=nums[i%n];\n        }\n        \n        return ans;\n    }\n}\n```
['Java']