FilesExpand file tree

 master

/

Day08_ShuffleArray.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

52 lines (47 loc) · 1.64 KB

 master

/

Day08_ShuffleArray.java

Top

File metadata and controls

• Code
• Blame

52 lines (47 loc) · 1.64 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.util.Arrays;

public class Day08_ShuffleArray {

public static void main(String[] args) {

//Input: nums = [1,2,3,4,4,3,2,1], n = 4

//Output: [1,4,2,3,3,2,4,1]

int[] nums = {1,2,3,4,4,3,2,1};

int n = 4;

long startTime = System.nanoTime();

System.out.println(Arrays.toString(shuffle(nums,n)));

long endTime = System.nanoTime();

long duration = endTime - startTime;

System.out.println("Execution time: " + duration/1e+6 + " milli second");

System.out.println("Execution time: " + duration + " nano second");

long startTime1 = System.nanoTime();

System.out.println(Arrays.toString(optimizedShuffle(nums,n)));

long endTime1 = System.nanoTime();

long duration1 = endTime1 - startTime1;

System.out.println("Execution time: " + duration1/1e+6 + " milli second");

}

public static int[] shuffle(int[] nums, int n) {

int[] Array = new int[nums.length];

int num = 0;

while(num < nums.length){

if(num>1 && num % 2 ==0){

Array[num] = nums[num/2];

num++;

Array[num] = nums[(num/2)+n];

}else{

Array[num] = nums[num];

num++;

Array[num] = nums[(num-1)+n];

}

num++;

}

return Array;

}

public static int[] optimizedShuffle(int[] nums, int n){

int[] Array = new int[nums.length];

int k=0;

for(int i=0;i<n;i++) {

Array[k]=nums[i];

Array[k+1]=nums[i+n];

k=k+2;

}

return Array;

}

}