Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
lose-sea
leetcode
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
0
(
0
)
Star
0
(
0
)
You must be signed in to star a repository
About
leekcode
Activity
Stars
0
stars
Watchers
0
watching
Forks
0
forks
Report repository
main
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
208 Commits
208 Commits
Folders and files
Name
Name
Last commit message
Last commit date
.DS_Store
.DS_Store
1.两数之和.c
1.两数之和.c
1.两数之和.cpp
1.两数之和.cpp
1005.k-次取反后最大化的数组和.cpp
1005.k-次取反后最大化的数组和.cpp
101.对称二叉树.cpp
101.对称二叉树.cpp
102.二叉树的层序遍历.cpp
102.二叉树的层序遍历.cpp
1035.不相交的线.cpp
1035.不相交的线.cpp
104.二叉树的最大深度.cpp
104.二叉树的最大深度.cpp
1047.删除字符串中的所有相邻重复项.cpp
1047.删除字符串中的所有相邻重复项.cpp
1049.最后一块石头的重量-ii.cpp
1049.最后一块石头的重量-ii.cpp
105.从前序与中序遍历序列构造二叉树.cpp
105.从前序与中序遍历序列构造二叉树.cpp
1052.爱生气的书店老板.cpp
1052.爱生气的书店老板.cpp
106.从中序与后序遍历序列构造二叉树.cpp
106.从中序与后序遍历序列构造二叉树.cpp
107.二叉树的层序遍历-ii.cpp
107.二叉树的层序遍历-ii.cpp
108.将有序数组转换为二叉搜索树.cpp
108.将有序数组转换为二叉搜索树.cpp
110.平衡二叉树.cpp
110.平衡二叉树.cpp
111.二叉树的最小深度.cpp
111.二叉树的最小深度.cpp
112.路径总和.cpp
112.路径总和.cpp
113.路径总和-ii.cpp
113.路径总和-ii.cpp
1143.最长公共子序列.cpp
1143.最长公共子序列.cpp
115.不同的子序列.cpp
115.不同的子序列.cpp
116.填充每个节点的下一个右侧节点指针.cpp
116.填充每个节点的下一个右侧节点指针.cpp
117.填充每个节点的下一个右侧节点指针-ii.cpp
117.填充每个节点的下一个右侧节点指针-ii.cpp
121.买卖股票的最佳时机.cpp
121.买卖股票的最佳时机.cpp
122.买卖股票的最佳时机-ii.cpp
122.买卖股票的最佳时机-ii.cpp
123.买卖股票的最佳时机-iii.cpp
123.买卖股票的最佳时机-iii.cpp
1281.整数的各位积和之差.cpp
1281.整数的各位积和之差.cpp
131.分割回文串.cpp
131.分割回文串.cpp
134.加油站.cpp
134.加油站.cpp
1343.大小为-k-且平均值大于等于阈值的子数组数目.cpp
1343.大小为-k-且平均值大于等于阈值的子数组数目.cpp
135.分发糖果.cpp
135.分发糖果.cpp
139.单词拆分.cpp
139.单词拆分.cpp
142.环形链表-ii.cpp
142.环形链表-ii.cpp
1422.分割字符串的最大得分.cpp
1422.分割字符串的最大得分.cpp
1423.可获得的最大点数.cpp
1423.可获得的最大点数.cpp
144.二叉树的前序遍历.cpp
144.二叉树的前序遍历.cpp
145.二叉树的后序遍历.cpp
145.二叉树的后序遍历.cpp
1456.定长子串中元音的最大数目.cpp
1456.定长子串中元音的最大数目.cpp
1470.重新排列数组.cpp
1470.重新排列数组.cpp
1486.数组异或操作.cpp
1486.数组异或操作.cpp
15.三数之和.cpp
15.三数之和.cpp
150.逆波兰表达式求值.cpp
150.逆波兰表达式求值.cpp
151.反转字符串中的单词.cpp
151.反转字符串中的单词.cpp
1512.好数对的数目.cpp
1512.好数对的数目.cpp
1534.统计好三元组.cpp
1534.统计好三元组.cpp
1679.k-和数对的最大数目.cpp
1679.k-和数对的最大数目.cpp
18.四数之和.cpp
18.四数之和.cpp
188.买卖股票的最佳时机-iv.cpp
188.买卖股票的最佳时机-iv.cpp
19.删除链表的倒数第-n-个结点.cpp
19.删除链表的倒数第-n-个结点.cpp
198.打家劫舍.cpp
198.打家劫舍.cpp
199.二叉树的右视图.cpp
199.二叉树的右视图.cpp
20.有效的括号.cpp
20.有效的括号.cpp
203.移除链表元素.cpp
203.移除链表元素.cpp
209.长度最小的子数组.cpp
209.长度最小的子数组.cpp
2090.半径为-k-的子数组平均值.cpp
2090.半径为-k-的子数组平均值.cpp
213.打家劫舍-ii.cpp
213.打家劫舍-ii.cpp
216.组合总和-iii.cpp
216.组合总和-iii.cpp
219.存在重复元素-ii.cpp
219.存在重复元素-ii.cpp
222.完全二叉树的节点个数.cpp
222.完全二叉树的节点个数.cpp
2235.两整数相加.cpp
2235.两整数相加.cpp
2236.判断根结点是否等于子结点之和.cpp
2236.判断根结点是否等于子结点之和.cpp
225.用队列实现栈.cpp
225.用队列实现栈.cpp
226.翻转二叉树.cpp
226.翻转二叉树.cpp
231.2-的幂.cpp
231.2-的幂.cpp
232.用栈实现队列.cpp
232.用栈实现队列.cpp
2342.数位和相等数对的最大和.cpp
2342.数位和相等数对的最大和.cpp
235.二叉搜索树的最近公共祖先.cpp
235.二叉搜索树的最近公共祖先.cpp
236.二叉树的最近公共祖先.cpp
236.二叉树的最近公共祖先.cpp
2379.得到-k-个黑块的最少涂色次数.cpp
2379.得到-k-个黑块的最少涂色次数.cpp
239.滑动窗口最大值.cpp
239.滑动窗口最大值.cpp
24.两两交换链表中的节点.cpp
24.两两交换链表中的节点.cpp
2413.最小偶倍数.cpp
2413.最小偶倍数.cpp
242.有效的字母异位词.cpp
242.有效的字母异位词.cpp
2461.长度为-k-子数组中的最大和.cpp
2461.长度为-k-子数组中的最大和.cpp
2469.温度转换.cpp
2469.温度转换.cpp
25.k-个一组翻转链表.cpp
25.k-个一组翻转链表.cpp
257.二叉树的所有路径.cpp
257.二叉树的所有路径.cpp
258.各位相加.cpp
258.各位相加.cpp
2586.统计范围内的元音字符串数.cpp
2586.统计范围内的元音字符串数.cpp
263.丑数.cpp
263.丑数.cpp
27.移除元素.c
27.移除元素.c
279.完全平方数.cpp
279.完全平方数.cpp
28.找出字符串中第一个匹配项的下标.cpp
28.找出字符串中第一个匹配项的下标.cpp
283.移动零.cpp
283.移动零.cpp
2841.几乎唯一子数组的最大和.cpp
2841.几乎唯一子数组的最大和.cpp
3.无重复字符的最长子串.cpp
3.无重复字符的最长子串.cpp
300.最长递增子序列.cpp
300.最长递增子序列.cpp
303.区域和检索-数组不可变.cpp
303.区域和检索-数组不可变.cpp
309.买卖股票的最佳时机含冷冻期.cpp
309.买卖股票的最佳时机含冷冻期.cpp
31.下一个排列.cpp
31.下一个排列.cpp
32.最长有效括号.c
32.最长有效括号.c
322.零钱兑换.cpp
322.零钱兑换.cpp
326.3-的幂.cpp
326.3-的幂.cpp
33.搜索旋转排序数组.cpp
33.搜索旋转排序数组.cpp
337.打家劫舍-iii.cpp
337.打家劫舍-iii.cpp
34.在排序数组中查找元素的第一个和最后一个位置.cpp
34.在排序数组中查找元素的第一个和最后一个位置.cpp
343.整数拆分.cpp
343.整数拆分.cpp
3439.重新安排会议得到最多空余时间-i.cpp
3439.重新安排会议得到最多空余时间-i.cpp
344.反转字符串.cpp
344.反转字符串.cpp
347.前-k-个高频元素.cpp
347.前-k-个高频元素.cpp
View all files
About
leekcode
Activity
Stars
0
stars
Watchers
0
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.