Leetcode刷题笔记
cancanxinxin1
这个作者很懒,什么都没留下…
展开
-
LeetCode700 二叉树中的搜索 python3
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def searchBST(se...原创 2019-02-25 20:26:42 · 156 阅读 · 0 评论 -
LeetCode876 链表的中间结点 python3
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def middleNode(self, head: 'ListNode') ->...原创 2019-02-25 20:10:46 · 122 阅读 · 0 评论 -
LeetCode590 N叉树的后序遍历 Python3
""" # Definition for a Node. class Node: def __init__(self, val, children): self.val = val self.children = children """ class Solution: def postorder(self, root: 'Node') ->...原创 2019-02-24 15:58:47 · 188 阅读 · 0 评论 -
LeetCode867 转置矩阵 Python3
class Solution: def transpose(self, A: 'List[List[int]]') -> 'List[List[int]]': return [list(i) for i in zip(*A)]原创 2019-02-24 15:15:20 · 110 阅读 · 0 评论 -
LeetCode908 最小差值I Python
class Solution: def smallestRangeI(self, A: 'List[int]', K: 'int') -> 'int': res = max(A) - min(A) - 2*K if res < 0 : return 0 else: return re...原创 2019-02-23 09:58:01 · 144 阅读 · 0 评论 -
LeetCode929 独特的电子邮件地址
class Solution: def numUniqueEmails(self, emails: 'List[str]') -> 'int': res = set() for email in emails: local, domain = email.split('@')[0],email.split('@')[1] ...原创 2019-02-22 16:20:13 · 222 阅读 · 0 评论