package LeetCode.contact;
import java.util.Arrays;
class Solution_1929 {
public int[] getConcatenation(int[] nums) {
int[] copy = new int[2 * (nums.length)];
for(int i = 0; i < nums.length; i++ ){
copy[i] = nums[i];
copy[i+nums.length] = nums[i];
}
return copy;
}
}
public class leetcode_1929 {
public static void main(String[] args){
Solution_1929 sol = new Solution_1929();
int [] nums = new int[] {1,2,3,4};
int a[] = sol.getConcatenation(nums);
System.out.println(Arrays.toString(a));
}
}
LeetCode_1929:数组串联:Java
最新推荐文章于 2024-08-23 09:59:49 发布