首页
AI Coding
NEW
沸点
课程
直播
活动
AI刷题
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
会员
登录
注册
leetcode
我是王大你是谁
创建于2021-05-12
订阅专栏
python 解答 leetcode
等 30 人订阅
共750篇文章
创建于2021-05-12
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
leetcode 1219. Path with Maximum Gold(python)
leetcode 1219. Path with Maximum Gold(python)DFS 解题
leetcode 1876. Substrings of Size Three with Distinct Characters(python)
leetcode 1876. Substrings of Size Three with Distinct Characters(python)三种解法,本质一样,只是代码形式不同
leetcode 1415.The k-th Lexicographical String of All Happy Strings of Length n
leetcode 1415.The k-th Lexicographical String of All Happy Strings of Length n 一种直接遍历解法,一种递归解法
leetcode 1806.Minimum Number of Operations to Reinitialize a Permutation(python)
leetcode 1806.Minimum Number of Operations to Reinitialize a Permutation(python)两种解法,一种遍历,一种递归
1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Thresh
leetcode 1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold(python)
leetcode 1232. Check If It Is a Straight Line(python)
leetcode 1232. Check If It Is a Straight Line(python)本题主要考察了数学中斜率的概念,在代码实现过程中要考虑到各种边界条件
leetcode 1893. Check if All the Integers in a Range Are Covered(python)
leetcode 1893. Check if All the Integers in a Range Are Covered(python)
leetcode 234. Palindrome Linked List(python)
leetcode 234. Palindrome Linked List(python)两种解法,考的都是链表移位或者赋值的基本操作
leetcode 1877. Minimize Maximum Pair Sum in Array(python)
leetcode 1877. Minimize Maximum Pair Sum in Array(python)
leetcode 1551. Minimum Operations to Make Array Equal(python)
leetcode 1551. Minimum Operations to Make Array Equal(python)
leetcode 24. Swap Nodes in Pairs(python)
leetcode 24. Swap Nodes in Pairs(python)一种解法需要修改原链表中的值,一种解法直接修改链表的节点
leetcode 1694. Reformat Phone Number(python)
leetcode 1694. Reformat Phone Number(python)常规解法。
leetcode 1566. Detect Pattern of Length M Repeated K or More Times(python)
leetcode 1566. Detect Pattern of Length M Repeated K or More Times(python)
leetcode 1952. Three Divisors(python)
leetcode 1952. Three Divisors(python)两种解法,一种是一次遍历法,一种是总结技巧法
leetcode 1935. Maximum Number of Words You Can Type(python)
leetcode 1935. Maximum Number of Words You Can Type(python)一次遍历解法和内置函数解法
leetcode 1941. Check if All Characters Have Equal Number of Occurrences(python)
leetcode 1941. Check if All Characters Have Equal Number of Occurrences(python)
leetcode 1957. Delete Characters to Make Fancy String (python)
leetcode 1957. Delete Characters to Make Fancy String (python)
leetcode 1961. Check If String Is a Prefix of Array(python)
leetcode 1961. Check If String Is a Prefix of Array(python)一次遍历解法和内置函数解法
leetcode 806. Number of Lines To Write String(python)
leetcode 806. Number of Lines To Write String(python)一次遍历解法
leetcode 1929. Concatenation of Array(python)
leetcode 1929. Concatenation of Array(python)此题太简单
下一页