題目

Given a number N, return a string consisting of "0"s and "1"s that represents its value in base -2

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:

  1. 0 <= N <= 10^9

題目大意

給出數字 N，返回由若干 "0" 和 "1"組成的字符串，該字符串為 N 的負二進制（base -2）表示。除非字符串就是 "0"，否則返回的字符串中不能含有前導零。

提示：

  • 0 <= N <= 10^9

解題思路

  • 給出一個十進制的數，要求轉換成 -2 進制的數
  • 這一題仿造十進制轉二進制的思路，短除法即可。

。

參考代碼

package leetcode

import "strconv"

func baseNeg2(N int) string {
	if N == 0 {
		return "0"
	}
	res := ""
	for N != 0 {
		remainder := N % (-2)
		N = N / (-2)
		if remainder < 0 {
			remainder += 2
			N++
		}
		res = strconv.Itoa(remainder) + res
	}
	return res
}