[LeetCode/Easy] 1929. Concatenation of Array

1. Input

1) 정수 배열 nums

- nums.length == n

 

2. Output

1) 다음 규칙대로 만든 배열 ans

- ans[i] == nums[i]

- ans[i + n] == nums[i]

 

3. Constraint

1) 1 <= n <= 1000

2) 1 <= nums[i] <= 1000

 

4. Example

Input: nums = [1,3,2,1] -> Output: [1,3,2,1,1,3,2,1]

 

5. Code

1) 첫 코드(2022/06/01)

int[] ans = new int[nums.length*2];
for(int i=0 ; i<nums.length ; i++){
    ans[i] = ans[i+nums.length] = nums[i];
}
return ans;