FilesExpand file tree

 master

/

ReorderArrayByIndex.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

45 lines (40 loc) · 1.33 KB

 master

/

ReorderArrayByIndex.java

Copy path

Top

File metadata and controls

• Code
• Blame

45 lines (40 loc) · 1.33 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

package com.interview.array;

import java.util.Arrays;

/**

* Date 12/29/2015

* @author Tushar Roy

*

* Given two arrays one with values and other with index where values should be positioned. Move values to correct

* position

*

* Time complexity - O(n)

* Space complexity - O(1)

*

* http://www.geeksforgeeks.org/reorder-a-array-according-to-given-indexes/

*/

public class ReorderArrayByIndex {

public void reorder(int input[], int index[]) {

if(index.length != input.length) {

throw new IllegalArgumentException();

}

for (int i = 0 ; i < index.length; i++) {

while (index[i] != i) {

int sIndex = index[index[i]];

int sVal = input[index[i]];

index[index[i]] = index[i];

input[index[i]] = input[i];

index[i] = sIndex;

input[i] = sVal;

}

}

}

public static void main(String args[]) {

int input[] = {50, 40, 70, 60, 90};

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

ReorderArrayByIndex reorderArrayByIndex = new ReorderArrayByIndex();

reorderArrayByIndex.reorder(input, index);

Arrays.stream(input).forEach(i -> System.out.print(i + " "));

System.out.println();

Arrays.stream(index).forEach(i -> System.out.print(i + " "));

}

}