TayTay123的博客

Pythonclass Solution(object): def isMatch(self, s, p): """ :type s: str :type p: str :rtype: bool """ l_s = len(s) l_p= len(p) dp =...

Pythonclass Solution(object): def canCompleteCircuit(self, gas, cost): """ :type gas: List[int] :type cost: List[int] :rtype: int """ sum_gas=0 ...

Pythonclass Solution(object): def canJump(self, nums): """ :type nums: List[int] :rtype: bool """ start = 0 end = 0 n = len(nums) w...

Pythonclass Solution(object): def findContentChildren(self, g, s): """ :type g: List[int] :type s: List[int] :rtype: int """ g.sort() s.so...

1.双指针双指针还是太慢了class Solution(object): def isSubsequence(self, s, t): """ :type s: str :type t: str :rtype: bool """ i=0 j=0 while i...

Pythonclass Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ ans = 0 for i in range(1, len(prices)): ...

Python# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: de...

Python# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object...

Python# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(objec...

# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def maxD...

Python# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object)...

Python# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object)...

Pythonclass Solution(object): def isMatch(self, s, p): len_s = len(s) len_p = len(p) res_m = [[False for j in range(len_p + 1)] for i in range(len_s + 1)] for i in...

Python(中心扩展算法)class Solution: def longestPalindrome(self,s): if s is None and len(s) < 1:return 0 start = end = 0 for i in range(len(s)-1): len1 = self.around(s,i,i) len2 = self.aroun...

Pythonclass Solution: def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ st = {} i, ans = 0, 0 for j in range(len(s)):...

Pythonclass Solution(object): def isValid(self, s): """ :type s: str :rtype: bool """ stack = [] left = ['(', '{', '['] right = [')', '}',...

Pythonclass Solution(object): def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ strs = list(set(strs)) if len(strs) &g...

例如， 罗马数字 2 写做 II ，即为两个并列的 1。12 写做 XII ，即为 X + II 。 27 写做 XXVII, 即为 XX + V + II 。通常情况下，罗马数字中小的数字在大的数字的右边。但也存在特例，例如 4 不写做 IIII，而是 IV。数字 1 在数字 5 的左边，所表示的数等于大数 5 减小数 1 得到的数值 4 。同样地，数字 9 表示为 IX。这个特殊的规则只适...

Python# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def mergeKLists(self, ...

Python# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def removeNthFromEnd(s...

Pythonclass Solution(object): def addTwoNumbers(self, l1, l2): l = ListNode(0) l_copy = l carry = 0 while l1 or l2: l1_val = l1.val if l1 else 0 ...

Pythonclass Solution(object): def hasCycle(self, head): if(head == None or head.next == None): return False slow = head fast = head.next while(slow !=...

Pythonclass Solution(object): def deleteDuplicates(self, head): if not (head and head.next): return head i,j = head,head while j: if i.val!=j.val: i = i.next i.val = j.val j =...

class Solution(object): def mergeTwoLists(self, l1, l2): if l1 is None: return l2 elif l2 is None: return l1 elif l1.val < l2.val: l...

Pythonclass Solution: def maxProfit(self, prices): if prices==[]:return 0 length=len(prices) b1= [0 for x in prices ] s1 = prices[0] b1[0]= 0 for ...

Python（双指针）class Solution(object): def threeSumClosest(self, nums, target): nums.sort() length=len(nums) flag=float("inf") for i in range(length): if i...

Pythonclass Solution: def threeSum(self, nums): nums.sort() count = [] length = len(nums) for i in range(length): if i > 0 and nums[i] == nums[i-1]:...

python:比较简单的直接暴力法class Solution(object): def removeElement(self, nums, val): for i in range(len(nums)-1, -1, -1): if nums[i] == val: nums.pop(i) return le...

Pythonclass Solution(object): def removeDuplicates(self, nums): length=len(nums) count=0 for i in range(1,length): if nums[count]!=nums[i]: nu...

class Solution(object): def twoSum(self, nums, target): num_dict = {} for i, num in enumerate(nums): num_dict[i] = num for j in num_dict: if num_dict[j] == (target - num) and j != i: return [j, i]解题思...