classSolution: defaddStrings(self, nums1: str, nums2: str) -> str: n = max(len(nums1),len(nums2)) nums1 = '0'*(n - len(nums1)) + nums1 nums2 = '0'*(n - len(nums2)) + nums2 s = '' f = 0#表示是否存在进位 for i inrange(n-1,-1,-1): t = int(nums1[i]) + int(nums2[i]) + f f = t//10 t = t%10 s += str(t) if f: s+='1' return s[::-1]