1.第一题:
本来是个很简单的题,这该死的判断条件,用的二分查找
class Solution:
def firstBadVersion(self, n):
"""
:type n: int
:rtype: int
"""
if n==1:
return 1
head=1
tail=n
mid=(head+tail)//2
while head<tail:
mid=(head+tail)//2
if isBadVersion(mid)==False:
head=mid
elif isBadVersion(mid)==True:
tail=mid
if head==tail:
return head
if head+1==tail and isBadVersion(head)==False:
return tail
2.第二题:
使用动态规划:
class Solution:
def numSquares(self, n: int) -> int:
dp=[i for i in range(n+1)]
for i in range(2,n+1):
for j in range(1,int(i**(0.5))+1):
dp[i]=min(dp[i],dp[i-j*j]+1)
return dp[-1]
3.第三题:
class Solution:
def isUgly(self, num: int) -> bool:
if num<=0:
return False
while num!=1:
if num%2==0:
num//=2
elif num%3==0:
num//=3
elif num%5==0:
num//=5
else:
return False
return True