LeetCode:以字符串的形式返回n的最小的好进制

For an integer n,we call k>=2 a good base of n ,if all digits of n base k are 1.
Now given a string representing n,you should return the smallest good base of n in string 
format.

Example 1:
Input:"13"
Output:"3"
Explanation:13 base 3 is 111.

Example 2:
Input:"4681"
Output:"8"
Explanation:4681 base 8 is 11111.

Example 3:
Input:"1000000000000000000"
Output:"999999999999999999"
Explanation:1000000000000000000 base 999999999999999999 is 11.

题目大意:
对于给定的整数n,如果n的k(k>=2)进制数的所有数位全为1,则称k(k>=2)是n的一个好进制.以字符串的形式给出n,然后以字符串
的形式返回n的最小的好进制.

解题思路:
考虑到数字是正整数,而且可能很大,利用uint64位存储.
这道题需要k的前m项和为n,则k^m+k^(m-1)+....+k+1,则1-k^m/(1-k)=n,题目已知k>=2,m>=1,
m=logk(kn-n+1)-1<logk(kn)=l+logk(n); 所以1<=m<=log2(n),
可以得到 nk-n+1<nk, 则k<n(1/m). 则2<=k<n(1/m),再利用二分查找逼近最小的k.

Go语言实现

package main

import (
	"fmt"
	"math"
	"strconv"
)

func smallestGoodBase(n string)string{
	num,_:=strconv.ParseUint(n,10,64)//转换成64位无符号10进制整数
	for bit:=uint64(math.Log(float64((num))));bit>=1;bit--{
		low,high:=uint64(2),uint64(math.Pow(float64(num),1.0/float64(bit)))
		for low<high{
			mid:=uint64(low+(high-low)>>1)
			sum:=findBase(mid,bit) //当前值
			if sum==num{//判断是否等于目标值
				return strconv.FormatUint(mid,10)
			}else if sum>num{
				high=mid-1
			}else{
				low=mid+1
			}
		}
	}
	return strconv.FormatUint(num-1,10)
}

//计算k^m+k^(m-1)+...+k+1
func findBase(mid,bit uint64)uint64{
	sum,base:=uint64(1),uint64(1)
	for i:=uint64(1);i<=bit;i++{
		base*=mid
		sum+=base
	}
	return sum
}
func main(){
	n:="4681"
	fmt.Println(smallestGoodBase(n))
}