FilesExpand file tree

 master

/

Problem12.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

67 lines (55 loc) · 1.41 KB

 master

/

Problem12.java

Top

File metadata and controls

• Code
• Blame

67 lines (55 loc) · 1.41 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

class Problem12 {

public static void main(String[] args) {

System.out.println(new Problem12().intToRoman(1994));

}

public String intToRoman(int num) {

// split

int[] nums = new int[4];

int pos = 0;

while(num != 0) {

int t = num % 10;

num = (num - t) / 10;

nums[pos++] = t;

}

if (pos > 0) pos--;

StringBuffer sb = new StringBuffer();

for (int i = pos; i >= 0; i--) {

sb.append(parse(nums[i], i));

}

return sb.toString();

}

public String parse(int v, int pos) {

StringBuffer res = new StringBuffer();

//

char[][] arr = new char[4][2];

arr[0][0] = 'I';

arr[0][1] = 'V';

arr[1][0] = 'X';

arr[1][1] = 'L';

arr[2][0] = 'C';

arr[2][1] = 'D';

arr[3][0] = 'M';

if (v < 4) {

for (int tmp = 1; tmp <= v; tmp++) res.append(arr[pos][0]);

}

if (v == 4) {

res.append(arr[pos][0]).append(arr[pos][1]);

}

if (v == 5) {

res.append(arr[pos][1]);

}

if (v > 5 && v < 9) {

res.append(arr[pos][1]);

for (int tmp = 1; tmp <= v-5; tmp++) res.append(arr[pos][0]);

}

if (v == 9) {

res.append(arr[pos][0]);

res.append(arr[pos+1][0]);

}

// 50 + 5 + 3

// L VIII

// 1000 + 900 + 90 + 4

// 1000 + (1000-100) + (100-10) + (5-1)

return res.toString();

}

}