
leetcode
u010969626
这个作者很懒,什么都没留下…
展开
-
leetcode--150
class Solution: def evalRPN(self, tokens: List[str]) -> int: s = [] res = 0 if len(tokens)==1: return int(tokens[0]) for i in range(len(tokens)): if tokens[i] == "+": .原创 2020-05-19 21:01:17 · 184 阅读 · 0 评论 -
leetcode 1 两数之和
class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)): for j in range(i+1,len(nums)): if nums[i]+nums[j]==target: return [i,j] .原创 2020-05-12 10:01:30 · 129 阅读 · 0 评论