René's URL Explorer Experiment


Title: GitHub - ranxi2001/zero2Leetcode: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手 · GitHub

Open Graph Title: GitHub - ranxi2001/zero2Leetcode: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手

X Title: GitHub - ranxi2001/zero2Leetcode: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手

Description: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手. Contribute to ranxi2001/zero2Leetcode development by creating an account on GitHub.

Open Graph Description: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手. Contribute to ranxi2001/zero2Leetcode development by creating an account on GitHub.

X Description: 从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手. Contribute to ranxi2001/zero2Leetcode development by creating an account on GitHub.

Opengraph URL: https://github.com/ranxi2001/zero2Leetcode

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:dab01d54-130a-aa8a-7c28-12698deff63a
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idC376:397A9E:1DBCE95:2B33AC1:6A57993E
html-safe-nonce65d73bf530102f5fd75bc82ccebab2ee977d6f83cee9cc66a7e25ea7e052b6a4
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDMzc2OjM5N0E5RToxREJDRTk1OjJCMzNBQzE6NkE1Nzk5M0UiLCJ2aXNpdG9yX2lkIjoiNjY2NTAzOTAyMTc2MzY5Njk1OCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac51d349c42adbf60347cf9f014b922207770514e578476216c45ce77cc7348c33
hovercard-subject-tagrepository:1144271168
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/ranxi2001/zero2Leetcode
twitter:imagehttps://opengraph.githubassets.com/37d3a94943e4c3edcfc0450856da386636be6ebb65fc3e4817b8e7103a763bfd/ranxi2001/zero2Leetcode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/37d3a94943e4c3edcfc0450856da386636be6ebb65fc3e4817b8e7103a763bfd/ranxi2001/zero2Leetcode
og:image:alt从零基础 Python 到企业笔试机试的系统性LeetCode100刷题指南-配置免费AI刷题助手. Contribute to ranxi2001/zero2Leetcode development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Nonea87fc68e9bdf22e1c7e48ac6a60b98882f4bb103314b3f26b3460c61fc5441ae
turbo-cache-controlno-cache
go-importgithub.com/ranxi2001/zero2Leetcode git https://github.com/ranxi2001/zero2Leetcode.git
octolytics-dimension-user_id77790009
octolytics-dimension-user_loginranxi2001
octolytics-dimension-repository_id1144271168
octolytics-dimension-repository_nworanxi2001/zero2Leetcode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id1144271168
octolytics-dimension-repository_network_root_nworanxi2001/zero2Leetcode
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
releasea2198d0212ed703af207673eb4d0868d4f867a5b
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/ranxi2001/zero2Leetcode#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Franxi2001%2Fzero2Leetcode
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/open-source/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/open-source/accelerator
GitHub Starshttps://stars.github.com
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Franxi2001%2Fzero2Leetcode
Sign up https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=ranxi2001%2Fzero2Leetcode
Reloadhttps://github.com/ranxi2001/zero2Leetcode
Reloadhttps://github.com/ranxi2001/zero2Leetcode
Reloadhttps://github.com/ranxi2001/zero2Leetcode
ranxi2001 https://github.com/ranxi2001
zero2Leetcodehttps://github.com/ranxi2001/zero2Leetcode
Notifications https://github.com/login?return_to=%2Franxi2001%2Fzero2Leetcode
Fork 1 https://github.com/login?return_to=%2Franxi2001%2Fzero2Leetcode
Star 17 https://github.com/login?return_to=%2Franxi2001%2Fzero2Leetcode
Code https://github.com/ranxi2001/zero2Leetcode
Issues 1 https://github.com/ranxi2001/zero2Leetcode/issues
Pull requests 0 https://github.com/ranxi2001/zero2Leetcode/pulls
Actions https://github.com/ranxi2001/zero2Leetcode/actions
Projects https://github.com/ranxi2001/zero2Leetcode/projects
Security and quality 0 https://github.com/ranxi2001/zero2Leetcode/security
Insights https://github.com/ranxi2001/zero2Leetcode/pulse
Code https://github.com/ranxi2001/zero2Leetcode
Issues https://github.com/ranxi2001/zero2Leetcode/issues
Pull requests https://github.com/ranxi2001/zero2Leetcode/pulls
Actions https://github.com/ranxi2001/zero2Leetcode/actions
Projects https://github.com/ranxi2001/zero2Leetcode/projects
Security and quality https://github.com/ranxi2001/zero2Leetcode/security
Insights https://github.com/ranxi2001/zero2Leetcode/pulse
https://github.com/ranxi2001/zero2Leetcode
Brancheshttps://github.com/ranxi2001/zero2Leetcode/branches
Tagshttps://github.com/ranxi2001/zero2Leetcode/tags
https://github.com/ranxi2001/zero2Leetcode/branches
https://github.com/ranxi2001/zero2Leetcode/tags
166 Commitshttps://github.com/ranxi2001/zero2Leetcode/commits/main/
https://github.com/ranxi2001/zero2Leetcode/commits/main/
.github/workflowshttps://github.com/ranxi2001/zero2Leetcode/tree/main/.github/workflows
.github/workflowshttps://github.com/ranxi2001/zero2Leetcode/tree/main/.github/workflows
00_python_basicshttps://github.com/ranxi2001/zero2Leetcode/tree/main/00_python_basics
00_python_basicshttps://github.com/ranxi2001/zero2Leetcode/tree/main/00_python_basics
01_data_structureshttps://github.com/ranxi2001/zero2Leetcode/tree/main/01_data_structures
01_data_structureshttps://github.com/ranxi2001/zero2Leetcode/tree/main/01_data_structures
02_algorithmshttps://github.com/ranxi2001/zero2Leetcode/tree/main/02_algorithms
02_algorithmshttps://github.com/ranxi2001/zero2Leetcode/tree/main/02_algorithms
03_leetcode_practicehttps://github.com/ranxi2001/zero2Leetcode/tree/main/03_leetcode_practice
03_leetcode_practicehttps://github.com/ranxi2001/zero2Leetcode/tree/main/03_leetcode_practice
04_real_interviewshttps://github.com/ranxi2001/zero2Leetcode/tree/main/04_real_interviews
04_real_interviewshttps://github.com/ranxi2001/zero2Leetcode/tree/main/04_real_interviews
05_interviewhttps://github.com/ranxi2001/zero2Leetcode/tree/main/05_interview
05_interviewhttps://github.com/ranxi2001/zero2Leetcode/tree/main/05_interview
_datahttps://github.com/ranxi2001/zero2Leetcode/tree/main/_data
_datahttps://github.com/ranxi2001/zero2Leetcode/tree/main/_data
_layoutshttps://github.com/ranxi2001/zero2Leetcode/tree/main/_layouts
_layoutshttps://github.com/ranxi2001/zero2Leetcode/tree/main/_layouts
assetshttps://github.com/ranxi2001/zero2Leetcode/tree/main/assets
assetshttps://github.com/ranxi2001/zero2Leetcode/tree/main/assets
docshttps://github.com/ranxi2001/zero2Leetcode/tree/main/docs
docshttps://github.com/ranxi2001/zero2Leetcode/tree/main/docs
.gitignorehttps://github.com/ranxi2001/zero2Leetcode/blob/main/.gitignore
.gitignorehttps://github.com/ranxi2001/zero2Leetcode/blob/main/.gitignore
README.mdhttps://github.com/ranxi2001/zero2Leetcode/blob/main/README.md
README.mdhttps://github.com/ranxi2001/zero2Leetcode/blob/main/README.md
_config.ymlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/_config.yml
_config.ymlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/_config.yml
acm-playground.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/acm-playground.html
acm-playground.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/acm-playground.html
index.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/index.html
index.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/index.html
playground.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/playground.html
playground.htmlhttps://github.com/ranxi2001/zero2Leetcode/blob/main/playground.html
requirements.txthttps://github.com/ranxi2001/zero2Leetcode/blob/main/requirements.txt
requirements.txthttps://github.com/ranxi2001/zero2Leetcode/blob/main/requirements.txt
robots.txthttps://github.com/ranxi2001/zero2Leetcode/blob/main/robots.txt
robots.txthttps://github.com/ranxi2001/zero2Leetcode/blob/main/robots.txt
READMEhttps://github.com/ranxi2001/zero2Leetcode
https://github.com/ranxi2001/zero2Leetcode#zero2leetcode-
https://python.org
https://leetcode.cn/studyplan/top-100-liked/
https://github.com/ranxi2001/zero2Leetcode#-ai-%E5%88%B7%E9%A2%98%E5%8A%A9%E6%89%8B
https://github.com/ranxi2001/zero2Leetcode/blob/main/LICENSE
视频介绍https://github.com/ranxi2001/zero2Leetcode#-%E8%A7%86%E9%A2%91%E4%BB%8B%E7%BB%8D
开始学习https://github.com/ranxi2001/zero2Leetcode#-%E5%AD%A6%E4%B9%A0%E8%B7%AF%E7%BA%BF
题目列表https://github.com/ranxi2001/zero2Leetcode#-leetcode-hot-100
在线练习场https://github.com/ranxi2001/zero2Leetcode/blob/main/playground.html
ACM 模拟https://github.com/ranxi2001/zero2Leetcode/blob/main/acm-playground.html
AI 助手https://github.com/ranxi2001/zero2Leetcode#-ai-%E5%88%B7%E9%A2%98%E5%8A%A9%E6%89%8B
https://github.com/ranxi2001/zero2Leetcode#-项目简介
https://github.com/ranxi2001/zero2Leetcode#-核心亮点
https://github.com/ranxi2001/zero2Leetcode#-目标用户
https://github.com/ranxi2001/zero2Leetcode#️-学习周期
https://github.com/ranxi2001/zero2Leetcode#-视频介绍
https://www.bilibili.com/video/BV129QmBGE3Q/https://www.bilibili.com/video/BV129QmBGE3Q/
https://github.com/ranxi2001/zero2Leetcode#-ai-刷题助手
https://github.com/ranxi2001/zero2Leetcode#功能预览
https://github.com/ranxi2001/zero2Leetcode/blob/main/assets/images/screenshots/ai-fab-button.png
https://github.com/ranxi2001/zero2Leetcode/blob/main/assets/images/screenshots/ai-panel-open.png
https://github.com/ranxi2001/zero2Leetcode/blob/main/assets/images/screenshots/ai-context-response.png
https://github.com/ranxi2001/zero2Leetcode#快捷操作
https://github.com/ranxi2001/zero2Leetcode#使用方式
在线练习场https://github.com/ranxi2001/zero2Leetcode/blob/main/playground.html
https://github.com/ranxi2001/zero2Leetcode#-acm-模拟-ide
https://github.com/ranxi2001/zero2Leetcode#核心功能
https://github.com/ranxi2001/zero2Leetcode#使用方式-1
ACM 模拟 IDEhttps://github.com/ranxi2001/zero2Leetcode/blob/main/acm-playground.html
https://github.com/ranxi2001/zero2Leetcode#️-学习路线
https://github.com/ranxi2001/zero2Leetcode#阶段一python-基础-1-2-周-00_python_basics
https://github.com/ranxi2001/zero2Leetcode#阶段二数据结构-2-3-周-01_data_structures
https://github.com/ranxi2001/zero2Leetcode#阶段三核心算法-3-4-周-02_algorithms
https://github.com/ranxi2001/zero2Leetcode#阶段四leetcode-实战-2-3-周-03_leetcode_practice
https://github.com/ranxi2001/zero2Leetcode#-leetcode-hot-100
https://github.com/ranxi2001/zero2Leetcode#哈希表-5题
两数之和https://leetcode.cn/problems/two-sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/hash/lc_001_two_sum.py
字母异位词分组https://leetcode.cn/problems/group-anagrams/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/hash/lc_049_group_anagrams.py
最长连续序列https://leetcode.cn/problems/longest-consecutive-sequence/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/hash/lc_128_longest_consecutive.py
https://github.com/ranxi2001/zero2Leetcode#双指针-4题
盛最多水的容器https://leetcode.cn/problems/container-with-most-water/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/two_pointers/lc_011_container.py
三数之和https://leetcode.cn/problems/3sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/two_pointers/lc_015_3sum.py
接雨水https://leetcode.cn/problems/trapping-rain-water/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/two_pointers/lc_042_trapping_rain.py
https://github.com/ranxi2001/zero2Leetcode#滑动窗口-4题
无重复字符的最长子串https://leetcode.cn/problems/longest-substring-without-repeating-characters/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/sliding_window/lc_003_longest_substring.py
最小覆盖子串https://leetcode.cn/problems/minimum-window-substring/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/sliding_window/lc_076_min_window.py
找到字符串中所有字母异位词https://leetcode.cn/problems/find-all-anagrams-in-a-string/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/sliding_window/lc_438_find_anagrams.py
https://github.com/ranxi2001/zero2Leetcode#子串子数组-6题
最大子数组和https://leetcode.cn/problems/maximum-subarray/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/subarray/lc_053_max_subarray.py
合并区间https://leetcode.cn/problems/merge-intervals/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/subarray/lc_056_merge_intervals.py
和为 K 的子数组https://leetcode.cn/problems/subarray-sum-equals-k/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/subarray/lc_560_subarray_sum.py
https://github.com/ranxi2001/zero2Leetcode#栈-6题
有效的括号https://leetcode.cn/problems/valid-parentheses/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/stack/lc_020_valid_parentheses.py
最小栈https://leetcode.cn/problems/min-stack/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/stack/lc_155_min_stack.py
字符串解码https://leetcode.cn/problems/decode-string/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/stack/lc_394_decode_string.py
每日温度https://leetcode.cn/problems/daily-temperatures/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/stack/lc_739_daily_temperatures.py
柱状图中最大的矩形https://leetcode.cn/problems/largest-rectangle-in-histogram/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/stack/lc_084_largest_rectangle.py
https://github.com/ranxi2001/zero2Leetcode#链表-9题
反转链表https://leetcode.cn/problems/reverse-linked-list/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_206_reverse_list.py
合并两个有序链表https://leetcode.cn/problems/merge-two-sorted-lists/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_021_merge_lists.py
环形链表https://leetcode.cn/problems/linked-list-cycle/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_141_has_cycle.py
环形链表 IIhttps://leetcode.cn/problems/linked-list-cycle-ii/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_142_detect_cycle.py
相交链表https://leetcode.cn/problems/intersection-of-two-linked-lists/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_160_intersection.py
删除链表的倒数第 N 个结点https://leetcode.cn/problems/remove-nth-node-from-end-of-list/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_019_remove_nth.py
两两交换链表中的节点https://leetcode.cn/problems/swap-nodes-in-pairs/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_024_swap_pairs.py
K 个一组翻转链表https://leetcode.cn/problems/reverse-nodes-in-k-group/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_025_reverse_k_group.py
排序链表https://leetcode.cn/problems/sort-list/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/linked_list/lc_148_sort_list.py
https://github.com/ranxi2001/zero2Leetcode#二叉树-15题
二叉树的中序遍历https://leetcode.cn/problems/binary-tree-inorder-traversal/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_094_inorder.py
二叉树的最大深度https://leetcode.cn/problems/maximum-depth-of-binary-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_104_max_depth.py
翻转二叉树https://leetcode.cn/problems/invert-binary-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_226_invert_tree.py
对称二叉树https://leetcode.cn/problems/symmetric-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_101_symmetric.py
二叉树的直径https://leetcode.cn/problems/diameter-of-binary-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_543_diameter.py
二叉树的层序遍历https://leetcode.cn/problems/binary-tree-level-order-traversal/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_102_level_order.py
将有序数组转换为BSThttps://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_108_sorted_array_to_bst.py
验证二叉搜索树https://leetcode.cn/problems/validate-binary-search-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_098_validate_bst.py
BST中第K小的元素https://leetcode.cn/problems/kth-smallest-element-in-a-bst/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_230_kth_smallest.py
二叉树的右视图https://leetcode.cn/problems/binary-tree-right-side-view/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_199_right_side_view.py
二叉树展开为链表https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_114_flatten.py
从前序与中序遍历序列构造二叉树https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_105_build_tree.py
路径总和 IIIhttps://leetcode.cn/problems/path-sum-iii/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_437_path_sum.py
二叉树的最近公共祖先https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_236_lca.py
二叉树中的最大路径和https://leetcode.cn/problems/binary-tree-maximum-path-sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/tree/lc_124_max_path_sum.py
https://github.com/ranxi2001/zero2Leetcode#图论-5题
岛屿数量https://leetcode.cn/problems/number-of-islands/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/graph/lc_200_num_islands.py
腐烂的橘子https://leetcode.cn/problems/rotting-oranges/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/graph/lc_994_rotting_oranges.py
课程表https://leetcode.cn/problems/course-schedule/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/graph/lc_207_course_schedule.py
实现 Trie (前缀树)https://leetcode.cn/problems/implement-trie-prefix-tree/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/graph/lc_208_trie.py
https://github.com/ranxi2001/zero2Leetcode#回溯-7题
全排列https://leetcode.cn/problems/permutations/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_046_permutations.py
子集https://leetcode.cn/problems/subsets/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_078_subsets.py
电话号码的字母组合https://leetcode.cn/problems/letter-combinations-of-a-phone-number/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_017_letter_combinations.py
组合总和https://leetcode.cn/problems/combination-sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_039_combination_sum.py
括号生成https://leetcode.cn/problems/generate-parentheses/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_022_generate_parentheses.py
单词搜索https://leetcode.cn/problems/word-search/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_079_word_search.py
分割回文串https://leetcode.cn/problems/palindrome-partitioning/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_131_palindrome_partition.py
N 皇后https://leetcode.cn/problems/n-queens/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/backtrack/lc_051_n_queens.py
https://github.com/ranxi2001/zero2Leetcode#二分查找-5题
搜索插入位置https://leetcode.cn/problems/search-insert-position/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/binary_search/lc_035_search_insert.py
搜索二维矩阵https://leetcode.cn/problems/search-a-2d-matrix/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/binary_search/lc_074_search_matrix.py
在排序数组中查找元素的第一个和最后一个位置https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/binary_search/lc_034_search_range.py
搜索旋转排序数组https://leetcode.cn/problems/search-in-rotated-sorted-array/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/binary_search/lc_033_search_rotated.py
寻找旋转排序数组中的最小值https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/binary_search/lc_153_find_min.py
https://github.com/ranxi2001/zero2Leetcode#动态规划-15题
爬楼梯https://leetcode.cn/problems/climbing-stairs/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_070_climbing_stairs.py
杨辉三角https://leetcode.cn/problems/pascals-triangle/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_118_pascal_triangle.py
打家劫舍https://leetcode.cn/problems/house-robber/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_198_house_robber.py
完全平方数https://leetcode.cn/problems/perfect-squares/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_279_perfect_squares.py
零钱兑换https://leetcode.cn/problems/coin-change/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_322_coin_change.py
单词拆分https://leetcode.cn/problems/word-break/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_139_word_break.py
最长递增子序列https://leetcode.cn/problems/longest-increasing-subsequence/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_300_lis.py
乘积最大子数组https://leetcode.cn/problems/maximum-product-subarray/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_152_max_product.py
分割等和子集https://leetcode.cn/problems/partition-equal-subset-sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_416_partition_subset.py
最长有效括号https://leetcode.cn/problems/longest-valid-parentheses/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_032_longest_valid_parentheses.py
不同路径https://leetcode.cn/problems/unique-paths/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_062_unique_paths.py
最小路径和https://leetcode.cn/problems/minimum-path-sum/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_064_min_path_sum.py
最长回文子串https://leetcode.cn/problems/longest-palindromic-substring/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_005_longest_palindrome.py
最长公共子序列https://leetcode.cn/problems/longest-common-subsequence/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_1143_lcs.py
编辑距离https://leetcode.cn/problems/edit-distance/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/dp/lc_072_edit_distance.py
https://github.com/ranxi2001/zero2Leetcode#贪心其他-8题
买卖股票的最佳时机https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/greedy/lc_121_buy_sell_stock.py
跳跃游戏https://leetcode.cn/problems/jump-game/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/greedy/lc_055_jump_game.py
跳跃游戏 IIhttps://leetcode.cn/problems/jump-game-ii/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/greedy/lc_045_jump_game_ii.py
划分字母区间https://leetcode.cn/problems/partition-labels/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/greedy/lc_763_partition_labels.py
只出现一次的数字https://leetcode.cn/problems/single-number/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/other/lc_136_single_number.py
多数元素https://leetcode.cn/problems/majority-element/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/other/lc_169_majority_element.py
颜色分类https://leetcode.cn/problems/sort-colors/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/other/lc_075_sort_colors.py
下一个排列https://leetcode.cn/problems/next-permutation/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/other/lc_031_next_permutation.py
寻找重复数https://leetcode.cn/problems/find-the-duplicate-number/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/other/lc_287_find_duplicate.py
https://github.com/ranxi2001/zero2Leetcode#堆-4题
数组中的第K个最大元素https://leetcode.cn/problems/kth-largest-element-in-an-array/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/heap/lc_215_kth_largest.py
前 K 个高频元素https://leetcode.cn/problems/top-k-frequent-elements/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/heap/lc_347_top_k_frequent.py
数据流的中位数https://leetcode.cn/problems/find-median-from-data-stream/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/heap/lc_295_median_finder.py
https://github.com/ranxi2001/zero2Leetcode#矩阵-4题
矩阵置零https://leetcode.cn/problems/set-matrix-zeroes/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/matrix/lc_073_set_matrix_zeroes.py
螺旋矩阵https://leetcode.cn/problems/spiral-matrix/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/matrix/lc_054_spiral_matrix.py
旋转图像https://leetcode.cn/problems/rotate-image/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/matrix/lc_048_rotate_image.py
搜索二维矩阵 IIhttps://leetcode.cn/problems/search-a-2d-matrix-ii/
solutionhttps://github.com/ranxi2001/zero2Leetcode/blob/main/03_leetcode_practice/matrix/lc_240_search_matrix_ii.py
https://github.com/ranxi2001/zero2Leetcode#-项目结构
https://github.com/ranxi2001/zero2Leetcode#-快速开始
https://github.com/ranxi2001/zero2Leetcode#本地运行
https://github.com/ranxi2001/zero2Leetcode#在线练习
LeetCode 力扣 Hot 100 官方题单https://leetcode.cn/studyplan/top-100-liked/
https://github.com/ranxi2001/zero2Leetcode#-学习建议
https://github.com/ranxi2001/zero2Leetcode#-license
onefly.top/zero2Leetcode/https://onefly.top/zero2Leetcode/
python https://github.com/topics/python
agent https://github.com/topics/agent
leetcode https://github.com/topics/leetcode
acm https://github.com/topics/acm
gpt https://github.com/topics/gpt
llm https://github.com/topics/llm
Readme https://github.com/ranxi2001/zero2Leetcode#readme-ov-file
Please reload this pagehttps://github.com/ranxi2001/zero2Leetcode
Activityhttps://github.com/ranxi2001/zero2Leetcode/activity
1 forkhttps://github.com/ranxi2001/zero2Leetcode/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Franxi2001%2Fzero2Leetcode&report=ranxi2001+%28user%29
Releaseshttps://github.com/ranxi2001/zero2Leetcode/releases
Packages 0https://github.com/users/ranxi2001/packages?repo_name=zero2Leetcode
Please reload this pagehttps://github.com/ranxi2001/zero2Leetcode
Contributorshttps://github.com/ranxi2001/zero2Leetcode/graphs/contributors
Please reload this pagehttps://github.com/ranxi2001/zero2Leetcode
JavaScript 62.8% https://github.com/ranxi2001/zero2Leetcode/search?l=javascript
CSS 19.0% https://github.com/ranxi2001/zero2Leetcode/search?l=css
HTML 14.8% https://github.com/ranxi2001/zero2Leetcode/search?l=html
Python 3.4% https://github.com/ranxi2001/zero2Leetcode/search?l=python
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width


URLs of crawlers that visited me.