拉一坨大的 好爽== 一二三四五 數學解到底沙小 def findKthBit(self, n: int, k: int) -> str: def invert(s): tmp = "" for c in s: if c=="1": tmp += "0" else: tmp += "1" return tmp def helper(prev, k): if k==0: return "1" elif k<=len(prev): if prev[-k]=="1": return "0" else: return "1" else: return helper(prev+"1"+invert(prev)[::-1], k-len(prev)-1) if k==1: return "0" else: return helper("0", k-2) -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.229.37.69 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1729352277.A.45D.html