![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
miahhrgbfcyur
这个作者很懒,什么都没留下…
展开
-
深入理解计算机系统
leal和mov的用法:https://blog.csdn.net/farmwang/article/details/75103220原创 2019-12-11 20:21:32 · 105 阅读 · 0 评论 -
leetcode 1202 python
题目要求:https://leetcode-cn.com/problems/smallest-string-with-swaps/class Solution: def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: p = {i:i for i in range(len(...原创 2019-12-11 20:10:25 · 114 阅读 · 0 评论 -
leetcode 200 python
题目要求:https://leetcode-cn.com/problems/number-of-islands/class Solution: def numIslands(self, grid: List[List[str]]) -> int: if not grid: return 0 row = len(grid) col =...原创 2019-12-11 19:03:57 · 176 阅读 · 0 评论 -
leetcode 130 python
题目要求:https://leetcode-cn.com/problems/surrounded-regions/class Solution: def solve(self, board: List[List[str]]) -> None: """ Do not return anything, modify board in-place ins...原创 2019-12-11 18:51:53 · 161 阅读 · 0 评论 -
leetcode 128 python
class Solution: def longestConsecutive(self, nums: List[int]) -> int: if not nums: return 0 nums.sort() longest_streak = 1 current_streak = 1 ...原创 2019-12-11 15:00:45 · 195 阅读 · 0 评论 -
leetcode 1025 python
题目要求:https://leetcode-cn.com/problems/divisor-game/思路:如果N是奇数,因为奇数的所有因数都是奇数,因此 N 进行一次 N-x 的操作结果一定是偶数,所以如果 a 拿到了一个奇数,那么轮到 b 的时候,b拿到的肯定是偶数,这个时候 b 只要进行 -1, 还给 a 一个奇数,那么这样子b就会一直拿到偶数,到最后b一定会拿到最小偶数2,a就输了。...原创 2019-12-09 19:38:33 · 101 阅读 · 0 评论 -
leetcode 746 python 动态规划
题目要求:https://leetcode-cn.com/problems/min-cost-climbing-stairs/class Solution: def minCostClimbingStairs(self, cost: List[int]) -> int: if len(cost) == 0: return 0 ...原创 2019-11-29 15:02:28 · 124 阅读 · 0 评论 -
python查找元素的下标 leetcode 392
a_list.index(‘a’) //返回a在列表中每一次出现的位置,默认搜索整个列表a_list.index(‘a’,0,3) //返回a在指定切片内第一次出现的位置题目要求:https://leetcode-cn.com/problems/is-subsequence/class Solution: def isSubsequence(self, s: str, t: str...原创 2019-11-29 14:41:30 · 185 阅读 · 0 评论 -
leetcode 303 python(动态规划)
题目要求:https://leetcode-cn.com/problems/range-sum-query-immutable/class NumArray: def __init__(self, nums: List[int]): self.dp = nums[:] # self.dp[i]存储0~i的子序列和 fo...原创 2019-11-18 19:25:48 · 197 阅读 · 0 评论 -
leetcode 198 python
题目要求:https://leetcode-cn.com/problems/house-robber/class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) == 1: retu...原创 2019-11-18 16:24:20 · 175 阅读 · 0 评论 -
leetcode 121 python(动态规划)
题目要求:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/class Solution: def maxProfit(self, prices: List[int]) -> int: if not prices: return 0 dp = [...原创 2019-11-18 16:16:18 · 188 阅读 · 0 评论 -
leetcode 70 python (动态规划)
题目要求:https://leetcode-cn.com/problems/climbing-stairs/class Solution: def climbStairs(self, n: int) -> int: if n == 1: return 1 if n == 2: return 2 ...原创 2019-11-17 22:36:42 · 130 阅读 · 0 评论 -
leetcode 53 python 动态规划
题目要求:https://leetcode-cn.com/problems/maximum-subarray/弄一个数组,dp[i]存到当前位置结束时最大的前缀和。class Solution: def maxSubArray(self, nums: List[int]) -> int: if not nums: return 0 ...原创 2019-11-17 21:43:25 · 67 阅读 · 0 评论 -
leetcode 315 python
题目要求:https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/python列表insert的操作:https://www.iplaypy.com/jinjie/list-insert.htmlpython内置函数binect的用法:https://www.cnblogs.com/skydesign/ar...原创 2019-11-16 22:31:20 · 225 阅读 · 0 评论 -
leetcode 179 python
题目要求:https://leetcode-cn.com/problems/largest-number/python中map函数的用法:https://www.runoob.com/python/python-func-map.htmlpython中lstrip和rstrip的用法:https://blog.csdn.net/csdn15698845876/article/detail...原创 2019-11-16 20:23:05 · 146 阅读 · 0 评论 -
leetcode 151 python
题目要求:https://leetcode-cn.com/problems/reverse-words-in-a-string/split()当不带参数时以空格进行分割(不管几个空格全部砍掉),当代参数时,以该参数进行分割。python 字符串(str)和列表(list)的互相转换:https://blog.csdn.net/roytao2/article/details/534333...原创 2019-11-16 16:14:00 · 294 阅读 · 0 评论 -
leetcode 646 python
题目要求:https://leetcode-cn.com/problems/maximum-length-of-pair-chain/思路:很简单的贪心class Solution: def findLongestChain(self, pairs: List[List[int]]) -> int: pairs.sort(key=lambda x: x[1])...原创 2019-11-16 15:55:20 · 112 阅读 · 0 评论 -
leetcode 241 python
题目要求:https://leetcode-cn.com/problems/different-ways-to-add-parentheses/思路:分治法,递归def diffWaysToCompute(input): # 如果只有数字,直接返回 if input.isdigit(): return [int(input)] ...原创 2019-11-16 15:41:55 · 180 阅读 · 0 评论 -
leetcode 42 python
题目要求:https://leetcode-cn.com/problems/trapping-rain-water/看到的一个大佬思路,实在是太有意思了!class Solution(object): def trap(self, height): """ :type height: List[int] :rtype: int ...原创 2019-11-15 15:13:43 · 95 阅读 · 0 评论 -
leetcode 45 python
题目要求:https://leetcode-cn.com/problems/jump-game-ii/原创 2019-11-13 21:38:30 · 130 阅读 · 0 评论 -
leetcode 61 python
题目要求:https://leetcode-cn.com/problems/rotate-list/原创 2019-11-13 21:07:18 · 219 阅读 · 0 评论 -
leetcode 76 python
题目要求:https://leetcode-cn.com/problems/minimum-window-substring/思路:滑动窗口原创 2019-11-13 20:08:07 · 93 阅读 · 0 评论 -
leetcode 81 python
题目要求:https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/原创 2019-11-13 19:52:58 · 140 阅读 · 0 评论 -
leetcode 85 python
题目要求:https://leetcode-cn.com/problems/maximal-rectangle/思路:https://blog.csdn.net/u014626513/article/details/81381948原创 2019-11-13 19:38:46 · 148 阅读 · 0 评论 -
leetcode 84 python
题目要求:https://leetcode-cn.com/problems/largest-rectangle-in-histogram/思路:https://blog.csdn.net/qq_17550379/article/details/85093224原创 2019-11-13 19:26:17 · 240 阅读 · 0 评论 -
leetcode 65 python
题目要求:https://leetcode-cn.com/problems/valid-number/原创 2019-11-13 17:23:05 · 92 阅读 · 0 评论 -
leetcode 95 python
题目要求:https://leetcode-cn.com/problems/unique-binary-search-trees-ii/comments/原创 2019-11-13 16:42:27 · 102 阅读 · 0 评论 -
leetcode 1161 python
https://leetcode-cn.com/problems/maximum-level-sum-of-a-binary-tree/submissions/class Solution(object): def maxLevelSum(self, root): """ :type root: TreeNode :rtype: int ...原创 2019-11-02 19:43:47 · 81 阅读 · 0 评论 -
leetcode 190 python
python中进制转化的内置函数:https://blog.csdn.net/xdreamman/article/details/93497535python中zfill自动补齐函数:https://www.runoob.com/python3/python3-string-zfill.htmlpython中bin函数:https://www.runoob.com/python/pyth...原创 2019-11-02 17:59:22 · 143 阅读 · 0 评论 -
leetcode 172 python
题目要求:https://leetcode-cn.com/problems/factorial-trailing-zeroes/这道题的思路记住了,但是要注意/和//的区别,/返回浮点数,答案错误,//返回整数。class Solution: def trailingZeroes(self, n: int) -> int: if n < 5: ...原创 2019-11-02 17:44:32 · 144 阅读 · 0 评论 -
leetcode python 1
题目要求:https://leetcode-cn.com/problems/two-sum/这道题是接触leetcode的第一道题,思路记住了,但是列表的初始化没记住。class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: d1 = {} d2 = ...原创 2019-11-02 17:39:21 · 91 阅读 · 0 评论 -
leetcode 1137 python
题目要求:https://leetcode-cn.com/problems/n-th-tribonacci-number/submissions/**动态规划的两种解题思路:向上递推和向下递归**class Solution: def tribonacci(self, n: int) -> int: dict1 = {0: 0, 1: 1, 2: 1} ...原创 2019-11-02 16:24:50 · 113 阅读 · 0 评论 -
leetcode 1164 python
题目要求:https://leetcode-cn.com/problems/day-of-the-year/python中strptime函数的用法:https://www.runoob.com/python/att-time-strptime.htmlimport timeclass Solution: def dayOfYear(self, date: str) -> ...原创 2019-11-02 16:15:53 · 121 阅读 · 0 评论 -
leetcode 1160 python
题目要求:https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters/python中all函数用法:all() 函数用于判断给定的可迭代参数 iterable 中的所有元素是否都为 TRUE,如果是返回 True,否则返回 False。元素除了是 0、空、None、False 外都算 True。...原创 2019-11-02 16:09:45 · 139 阅读 · 0 评论 -
leetcode 1170 python
题目要求:https://leetcode-cn.com/problems/compare-strings-by-frequency-of-the-smallest-character/submissions/class Solution: def numSmallerByFrequency(self, queries: List[str], words: List[str]) -&g...原创 2019-11-02 16:04:31 · 110 阅读 · 0 评论 -
leetcode 1184 python
题目要求:https://leetcode-cn.com/problems/distance-between-bus-stops/submissions/思路:注意start有可能大于destination的情况。class Solution: def distanceBetweenBusStops(self, distance: List[int], start: int, de...原创 2019-11-01 15:32:59 · 100 阅读 · 0 评论 -
leetcode 1185 python
题目要求:https://leetcode-cn.com/problems/day-of-the-week/submissions/import datetimeclass Solution: def dayOfTheWeek(self, day: int, month: int, year: int) -> str: l = ["Monday", "Tuesd...原创 2019-11-01 15:11:18 · 96 阅读 · 0 评论 -
leetcode 1189 python
题目要求:https://leetcode-cn.com/problems/maximum-number-of-balloons/class Solution: def maxNumberOfBalloons(self, text: str) -> int: d = collections.Counter(text) return min(d['b...原创 2019-11-01 12:05:47 · 137 阅读 · 0 评论 -
leetcode 1202 python
题目要求:https://leetcode-cn.com/problems/minimum-absolute-difference/submissions/class Solution: def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]: arr = sorted(arr) ...原创 2019-11-01 11:48:50 · 212 阅读 · 0 评论 -
leetcode 1217 python
题目要求:https://leetcode-cn.com/problems/unique-number-of-occurrences/submissions/from collections import Counterclass Solution: def uniqueOccurrences(self, arr: List[int]) -> bool: c =...原创 2019-10-29 10:17:11 · 136 阅读 · 1 评论