
-Code
class Solution {
public int[] shuffle(int[] nums, int n) {
int[] answer = new int[n * 2];
int idx = 0;
for (int i = 0; i < n; i++) {
answer[idx++] = nums[i];
answer[idx++] = nums[i + n];
}
return answer;
}
}'Beakjoon&프로그래머스 > Java' 카테고리의 다른 글
| [LeetCode/Java] Set Mismatch (0) | 2025.11.24 |
|---|---|
| [LeetCode/Java] Max Consecutive Ones (0) | 2025.11.24 |
| [LeetCode/Java] Concatenation of Array (0) | 2025.11.24 |
| [LeetCode/Java] 94. Binary Tree Inorder Traversal (0) | 2025.11.23 |
| [백준/Java] 15216번 Another Brick in the Wall (0) | 2025.11.23 |