class Solution:
def compareVersion(self, version1: str, version2: str) -> int:
for v1, v2 in zip_longest(version1.split('.'), version2.split('.'), fillvalue=0):
x, y = int(v1), int(v2)
if x != y:
return 1 if x > y else -1
return 0
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/compare-version-numbers/solution/bi-jiao-ban-ben-hao-by-leetcode-solution-k6wi/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。