Fighting_Du的博客

class Solution: def lengthOfLongestSubstring(self, s: str) -> int: lst = list(s) maxl = 0 sublst = [] for i in lst: if i in sublst: pos = sublst.index(i) sublst = sublst[po.

class Solution: def sumNums(self, n: int) -> int: lst = range(n+1) return sum(lst)这道题整有点蒙

class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ for i in range(len(nums)-1): for j in range(i+1,len(nums)): .