Re: [闲聊] 每日leetcode

楼主: DJYOMIYAHINA (通通打死)   2025-09-23 23:02:49
之前写过
但我也忘记怎么写了
能过就 过了吧
对ㄚ==
class Solution:
def compareVersion(self, version1: str, version2: str) -> int:
a = version1.split('.')
b = version2.split('.')
if len(a)<len(b):
a = a + ['0']*(len(b)-len(a))
else:
b = b + ['0']*(len(a)-len(b))
i = 0
while i<len(a):
if int(a[i])<int(b[i]):
return -1
elif int(a[i])>int(b[i]):
return 1
i += 1
return 0
作者: kingbalance (七海千秋我老婆)   2025-09-23 23:05:00
大师
作者: sustainer123 (caster)   2025-09-23 23:05:00
大师
作者: Chiitan (水獭七炭)   2025-09-23 23:42:00
大师

Links booklink

Contact Us: admin [ a t ] ucptt.com