FilesExpand file tree

 master

/

binary-representation.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

76 lines (66 loc) · 1.96 KB

 master

/

binary-representation.java

Copy path

Top

File metadata and controls

• Code
• Blame

76 lines (66 loc) · 1.96 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

public class Solution {

/**

*@param n: Given a decimal number that is passed in as a string

*@return: A string

*/

public static String binaryRepresentation(String n) {

// write your code here

// split the function into two parts:

// get the binary representation of decimal part

// get the interger part.

// first check if decimal part can be represented in

// binary form, then do the integer part transformation.

int len = n.length();

if (len == 0) {

return n;

}

String[] split = n.split("\\.");

String decimalPart = decBinary(split[1]);

if (decimalPart.equals("ERROR")) {

return decimalPart;

}

String intPart = intBinary(split[0]);

return decimalPart.equals("")? intPart : intPart + "." + decimalPart;

}

public static String decBinary(String num) {

String n = "0." + num;

double val = Double.parseDouble(n);

StringBuilder sb = new StringBuilder();

while (val != 0) {

if (sb.length() > 32) {

return "ERROR";

}

double r = val * 2;

if (r >= 1) {

sb.append(1);

val = r - 1;

} else {

sb.append(0);

val = r;

}

}

return sb.toString();

}

public static String intBinary(String num) {

// 5

// 1 1 1

// 101

int i = Integer.parseInt(num);

StringBuilder sb = new StringBuilder();

int base = 1;

int current = 0;

while (current != i) {

if ((i & base) != 0) {

sb.append(1);

current += base;

} else {

sb.append(0);

}

base = base << 1;

}

if (sb.length() == 0) {

sb.append(0);

}

return sb.reverse().toString();

}

}