-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram38.java
More file actions
65 lines (43 loc) · 1.45 KB
/
program38.java
File metadata and controls
65 lines (43 loc) · 1.45 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
1929. Concatenation of Array
Easy
2.3K
291
Companies
Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).
Specifically, ans is the concatenation of two nums arrays.
Return the array ans.
Example 1:
Input: nums = [1,2,1]
Output: [1,2,1,1,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]
- ans = [1,2,1,1,2,1]
Example 2:
Input: nums = [1,3,2,1]
Output: [1,3,2,1,1,3,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[3],nums[0],nums[1],nums[2],nums[3]]
- ans = [1,3,2,1,1,3,2,1]
*/
package LeetCode;
import javax.sound.sampled.SourceDataLine;
public class program38 {
static int[] getConcatenation(int[] nums) {
int res[] = new int[nums.length*2];
int j=0;
for(int i=0;i<nums.length;i++){
res[i] = nums[j];
res[2*i+nums.length-i] = nums[j];
j++;
}
return res;
}
public static void main(String[] args) {
int nums[] ={1,3,2,1};
int a[] = getConcatenation(nums);
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
}