반응형
Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
Tags
- springboottest spybean
- Only void methods can doNothing()
- yum install java
- JUnit
- log error
- OpenFeign
- tls프로토콜확인
- parse
- springboot
- java 11
- mockito에러
- AWS CLI
- ssl이란?
- error
- java version
- aws
- Medium
- ssl프로토콜확인
- LeetCode
- java 1.8 11
- java 버전 변경
- 스프링부트테스트
- ssl프로토콜
- No tests found for given includes
- springboottest
- java 여러개 버전
- easy
- Java 1.8
- java
- mockito테스트
Archives
- Today
- Total
쩨이엠 개발 블로그
[ Leetcode ] 1470. Shuffle the Array - Java 본문
728x90
반응형
Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].
Return the array in the form [x1,y1,x2,y2,...,xn,yn].
Example 1:
Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7]
Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].
Example 2:
Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]
Example 3:
Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]
Constraints:
- 1 <= n <= 500
- nums.length == 2n
- 1 <= nums[i] <= 10^3
Solution
class Solution {
public int[] shuffle(int[] nums, int n) {
int[] answer = new int[n*2];
for(int i=0; i< n ; i++){
answer[2*i] = nums[i];
answer[2*i+1] = nums[n+i];
}
return answer;
}
}
728x90
반응형
'개발 > Programming' 카테고리의 다른 글
[ Leetcode ] 1409. Queries on a Permutation With Key - Java (0) | 2021.01.30 |
---|---|
[ Leetcode ] 1476. Subrectangle Queries - Java (0) | 2021.01.29 |
[ Leetcode ] 1672. Richest Customer Wealth - Java (0) | 2021.01.28 |
[ Leetcode ] 214. Shortest Palindrome - Java (0) | 2021.01.28 |
[ Leetcode ] 162. Find Peak Element - Java (0) | 2021.01.28 |
Comments