FilesExpand file tree

 master

/

p_3_1.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

80 lines (59 loc) · 1.53 KB

 master

/

p_3_1.java

Copy path

Top

File metadata and controls

• Code
• Blame

80 lines (59 loc) · 1.53 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

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

package org.codingTest;

import java.util.HashSet;

import java.util.Iterator;

public class p_3_1 {

public static void main(String[] args) {

int[] n = { 3, 7, 2, 8, 6, 4, 5, 1 };

//solution(n, 3);

}

static int len, k;

static int min = 10000000;

public int solution(int[] numbers, int K) {

int answer = 0;

len = numbers.length;

k = K;

solve(numbers, count_diff(numbers), 0);

System.out.println(min);

return answer;

}

private static void solve(int[] number, int diff_count, int count) {

if (diff_count == 0) {

min = Math.min(min, count);

}

for (int i = 0; i < number.length - 1; i++) {

if (Math.abs(number[i] - number[i + 1]) > k) {

int next = (i + 3) % len;

while ( next != i) {

// 둘이 바꾼 배열

int[] newArr = number.clone();

newArr = swap(i, next, newArr);

// 이전보다 개수가 작아진다면

int newdiff = count_diff(newArr);

for (Integer n : newArr) {

System.out.print(n + " ");

}

System.out.println();

if (newdiff < diff_count) {

solve(newArr, newdiff, count + 1);

}

next = (next+1) % len;

}

}

}

}

private static int[] swap(int idx, int next, int[] arr) {

int tmp = arr[next];

arr[next] = arr[idx];

arr[idx] = tmp;

return arr;

}

private static int count_diff(int[] arr) {

int cnt = 0;

for (int i = 0; i < arr.length - 1; i++) {

if (Math.abs(arr[i] - arr[i + 1]) > k) {

cnt++;

}

}

return cnt;

}

}