![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
fenfenxhf
这个作者很懒,什么都没留下…
展开
-
有效的括号(Leetcode第20题)
方法一:class Solution: def isValid(self, s): """ :type s: str :rtype: bool """ if (len(s) % 2 == 1): return False dict_s...原创 2018-10-28 19:09:49 · 162 阅读 · 0 评论 -
杨辉三角(LeetCode第118题)
给定一个非负整数 numRows,生成杨辉三角的前 numRows 行。在杨辉三角中,每个数是它左上方和右上方的数的和。示例:输入: 5输出:[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]python实现class Solution: def generate(self, numRows):...原创 2018-11-12 11:10:30 · 264 阅读 · 0 评论 -
LeetCode第108 110 111 112题
将有序数组转换为二叉搜索树(LeetCode第108题)# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass ...原创 2018-11-08 21:13:24 · 214 阅读 · 0 评论 -
对称二叉树 二叉树的最大深度(LeetCode第101 104题)
# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def isSymmetric(s...原创 2018-11-05 22:39:51 · 259 阅读 · 0 评论 -
合并两个有序数组 合并相同的树(LeetCode第88 100题)
class Solution: def merge(self, nums1, m, nums2, n): """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: void Do not...原创 2018-11-05 18:26:03 · 287 阅读 · 0 评论 -
二叉树的层次遍历(LeetCode第107题)
# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def levelOrderBot...原创 2018-11-07 19:20:55 · 242 阅读 · 0 评论 -
LeetCode总结(第53 58 66 67题)
最大子序和(第53题)方法一:class Solution: def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ l = len(nums) results = nums[0] ...原创 2018-11-02 19:11:08 · 134 阅读 · 0 评论 -
报数(LeetCode第38题)
class Solution: def countAndSay(self, n): """ :type n: int :rtype: str """ output_str = "1" for i in range(n-1): #for i in rang...原创 2018-11-01 18:06:02 · 393 阅读 · 0 评论 -
搜索插入位置(LeetCode第35题)
方法一:class Solution: def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ if len(nums) == 0: ...原创 2018-11-01 11:02:25 · 124 阅读 · 0 评论 -
删除数组的重复项 移动元素 实现strStr()(LeetCode第26 27 28题)
第26题:删除数组的重复项class Solution: def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ i = 0 while i &a原创 2018-11-01 08:30:36 · 105 阅读 · 0 评论 -
LeetCode 总结(第1 7 9 13 14题)
1 两数之和class Solution: def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ """ #方法一:...原创 2018-10-27 16:54:31 · 132 阅读 · 0 评论 -
合并两个有序的链表(LeetCode第21题)
方法一:# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def mergeTwoLists(self, l1, l2): #这里的l1 ...原创 2018-10-31 17:45:43 · 133 阅读 · 0 评论 -
买卖股票的最佳时机(LeetCode 121 122题)
买卖股票的最佳时机I法一:class Solution: def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ maxdiff = 0 for i in ran...原创 2018-11-19 19:20:31 · 236 阅读 · 0 评论