FilesExpand file tree

 master

/

SameFaceDice.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (42 loc) · 1.23 KB

 master

/

SameFaceDice.java

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (42 loc) · 1.23 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

package exercise;

import org.junit.Test;

import static org.hamcrest.CoreMatchers.is;

import static org.junit.Assert.assertThat;

public class SameFaceDice {

/*

TASK

각각의 주사위들이 모두 같은 면을 보이기 위한 최소 rotate 횟수를 구한다.

*/

@Test

public void test() {

int[] arr1 = {1,2,3};

assertThat(solution(arr1), is(2));

int[] arr2 = {1,1,6};

assertThat(solution(arr2), is(2));

int[] arr3 = {1,6,2,3};

assertThat(solution(arr3), is(3));

int[] arr4 = {1,1};

assertThat(solution(arr4), is(0));

int[] arr5 = {3,3,4,4,2};

assertThat(solution(arr5), is(4));

}

public int solution(int[] A) {

int result = Integer.MAX_VALUE;

for (int dice = 1; dice <= 6; dice++) {

int count = 0;

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

if (A[i] != dice) {

if (A[i] + dice == 7) {

count += 2;

} else {

count += 1;

}

}

}

if (result >= count) {

result = count;

}

}

return result;

}

}