-
Notifications
You must be signed in to change notification settings - Fork 0
/
1017.convert-to-base-2.cpp
85 lines (84 loc) · 1.34 KB
/
1017.convert-to-base-2.cpp
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
81
82
83
84
/*
* @lc app=leetcode id=1017 lang=cpp
*
* [1017] Convert to Base -2
*
* https://leetcode.com/problems/convert-to-base-2/description/
*
* algorithms
* Medium (57.24%)
* Likes: 82
* Dislikes: 98
* Total Accepted: 6.5K
* Total Submissions: 11.4K
* Testcase Example: '2'
*
* Given a number N, return a string consisting of "0"s and "1"s that
* represents its value in base -2 (negative two).
*
* The returned string must have no leading zeroes, unless the string is
* "0".
*
*
*
*
* Example 1:
*
*
* Input: 2
* Output: "110"
* Explantion: (-2) ^ 2 + (-2) ^ 1 = 2
*
*
*
* Example 2:
*
*
* Input: 3
* Output: "111"
* Explantion: (-2) ^ 2 + (-2) ^ 1 + (-2) ^ 0 = 3
*
*
*
* Example 3:
*
*
* Input: 4
* Output: "100"
* Explantion: (-2) ^ 2 = 4
*
*
*
*
* Note:
*
*
* 0 <= N <= 10^9
*
*
*
*
*/
class Solution {
public:
string baseNeg2(int N) {
if ( N == 0) {
return "0";
}
string ret = "";
while (N) {
if (N % -2) {
ret = "1" + ret;
if (N > 0) {
N = N / -2;
} else {
N = (N / -2) + 1;
}
} else {
ret = "0" + ret;
N /= -2;
}
}
return ret;
}
};