(int arr[],int pos,int n)
| 2 | class Solution { |
| 3 | |
| 4 | public static void shift(int arr[],int pos,int n) |
| 5 | { |
| 6 | for(int i=n-2;i>=pos;i--) |
| 7 | { |
| 8 | arr[i+1]=arr[i]; |
| 9 | } |
| 10 | } |
| 11 | public int[] createTargetArray(int[] nums, int[] index) { |
| 12 | int target[] = new int[nums.length]; |
| 13 | for(int i=0;i<nums.length;i++) |