René's URL Explorer Experiment


Title: GitHub - itdoudoutech/LeetCode: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油

Open Graph Title: GitHub - itdoudoutech/LeetCode: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油

X Title: GitHub - itdoudoutech/LeetCode: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油

Description: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油. Contribute to itdoudoutech/LeetCode development by creating an account on GitHub.

Open Graph Description: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油. Contribute to itdoudoutech/LeetCode development by creating an account on GitHub.

X Description: 持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油. Contribute to itdoudoutech/LeetCode development by creating an account on GitHub.

Opengraph URL: https://github.com/itdoudoutech/LeetCode

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:e579556b-4c7f-a6b2-d77c-26a8624048a0
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id9C20:1CE4C:66410E:8C48AE:696F2381
html-safe-noncef4ae5b68df432326caf9992bf4864cfcc576103de15274549a12788913eb2db9
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5QzIwOjFDRTRDOjY2NDEwRTo4QzQ4QUU6Njk2RjIzODEiLCJ2aXNpdG9yX2lkIjoiMzQwNjIwNDc0ODk2NTU2OTI5IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmacf5ff66e9d912cb5be4dd995973a2c8366abf74c9c6a43dde01655845b9d38994
hovercard-subject-tagrepository:223098967
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/itdoudoutech/LeetCode
twitter:imagehttps://opengraph.githubassets.com/c0e29e31d5d0a1cb0c3bf82d3c2b885c1640f88e06efec9738ee4c8735b22533/itdoudoutech/LeetCode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/c0e29e31d5d0a1cb0c3bf82d3c2b885c1640f88e06efec9738ee4c8735b22533/itdoudoutech/LeetCode
og:image:alt持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油. Contribute to itdoudoutech/LeetCode development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noneb278ad162d35332b6de714dfb005de04386c4d92df6475522bef910f491a35ee
turbo-cache-controlno-preview
go-importgithub.com/itdoudoutech/LeetCode git https://github.com/itdoudoutech/LeetCode.git
octolytics-dimension-user_id21699517
octolytics-dimension-user_loginitdoudoutech
octolytics-dimension-repository_id223098967
octolytics-dimension-repository_nwoitdoudoutech/LeetCode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id163987850
octolytics-dimension-repository_parent_nwogaoshengnan/LeetCode
octolytics-dimension-repository_network_root_id163987850
octolytics-dimension-repository_network_root_nwogaoshengnan/LeetCode
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
release39aed5006635ab6f45e6b77d23e73b08a00272a3
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fitdoudoutech%2FLeetCode
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub SparkBuild and deploy intelligent appshttps://github.com/features/spark
GitHub ModelsManage and compare promptshttps://github.com/features/models
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
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
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/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://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fitdoudoutech%2FLeetCode
Sign up https://patch-diff.githubusercontent.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=itdoudoutech%2FLeetCode
Reloadhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
itdoudoutech https://patch-diff.githubusercontent.com/itdoudoutech
LeetCodehttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
gaoshengnan/LeetCodehttps://patch-diff.githubusercontent.com/gaoshengnan/LeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fitdoudoutech%2FLeetCode
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fitdoudoutech%2FLeetCode
Star 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fitdoudoutech%2FLeetCode
0 stars https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/stargazers
96 forks https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/forks
Branches https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/branches
Tags https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/tags
Activity https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Fitdoudoutech%2FLeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fitdoudoutech%2FLeetCode
Code https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Pull requests 0 https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/actions
Projects 0 https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/projects
Security Uh oh! There was an error while loading. Please reload this page. https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/security
Please reload this pagehttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Insights https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/pulse
Code https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Pull requests https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/actions
Projects https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/projects
Security https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/security
Insights https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/pulse
Brancheshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/branches
Tagshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/tags
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/branches
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/tags
258 Commitshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/commits/master/
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/commits/master/
src/mainhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/tree/master/src/main
src/mainhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/tree/master/src/main
.gitignorehttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/.gitignore
.gitignorehttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/.gitignore
CONTRIBUTING.mdhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/CONTRIBUTING.md
CONTRIBUTING.mdhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/CONTRIBUTING.md
README.mdhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/README.md
README.mdhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/README.md
pom.xmlhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/pom.xml
pom.xmlhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/pom.xml
READMEhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Contributinghttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/blob/master/src/main/resources/img/log/log.png
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#理论基础
数组https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.%E6%95%B0%E7%BB%84.md
链表https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/2.%E9%93%BE%E8%A1%A8.md
栈https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/3.%E6%A0%88.md
跳表https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/4.%E8%B7%B3%E8%A1%A8.md
散列表https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/5.%E6%95%A3%E5%88%97%E8%A1%A8.md
递归https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E9%80%92%E5%BD%92.md
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#面试常考算法题
盛最多水的容器https://leetcode-cn.com/problems/container-with-most-water/
container with most waterhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_11/ContainerWithMostWater.java
删除排序数组中重复项https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
remove Duplicates from sorted arrayhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_26/RemoveDuplicatesFromSortedArray.java
加一https://leetcode-cn.com/problems/plus-one/
plus onehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_66/PlusOne.java
爬楼梯https://leetcode-cn.com/problems/climbing-stairs/
climbing stairshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_70/ClimbingStairs.java
合并两个有序数组https://leetcode-cn.com/problems/merge-sorted-array/
merge sorted arrayhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_88/MergeSortedArray.java
旋转数组https://leetcode-cn.com/problems/rotate-array/
rotate arrayhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_189/RotateArray.java
移动零https://leetcode-cn.com/problems/move-zeroes/
move zeroeshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_283/MoveZeroes.java
合并两个有序链表https://leetcode-cn.com/problems/merge-two-sorted-lists/
merge two sorted listshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_21/MergeTwoSortedLists.java
两两交换链表中的节点https://leetcode-cn.com/problems/swap-nodes-in-pairs/
swap nodes in pairshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_24/SwapNodesInPairs.java
K 个一组翻转链表https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
reverse node in k grouphttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_25/ReverseNodesInkGroup.java
环形链表https://leetcode-cn.com/problems/linked-list-cycle/
linkedList cyclehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_141/LinkedListCycle.java
环形链表IIhttps://leetcode-cn.com/problems/linked-list-cycle-ii/
linked list cycle IIhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_142/LinkedListCycleII.java
反转链表https://leetcode.com/problems/reverse-linked-list/
reverse listhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_206/ReverseList.java
两数之和https://leetcode-cn.com/problems/two-sum/
two sumhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_1/TwoSum.java
三数之和https://leetcode-cn.com/problems/3sum/
three sumhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_15/ThreeSum.java
有效的括号https://leetcode-cn.com/problems/valid-parentheses/description/
valid parenthesehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_20/ValidParentheses.java
接雨水https://leetcode-cn.com/problems/trapping-rain-water/
trapping rain waterhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_42/TrappingRainWater.java
字母异位词分组https://leetcode-cn.com/problems/group-anagrams/
group anagramshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_49/GroupAnagrams.java
柱状图中最大的矩形https://leetcode-cn.com/problems/largest-rectangle-in-histogram/
最小栈https://leetcode-cn.com/problems/min-stack/
min stackhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_155/MinStack.java
滑动窗口最大值https://leetcode-cn.com/problems/sliding-window-maximum/
sliding window maximumhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_239/SlidingWindowMaximum.java
有效的字母异位词https://leetcode-cn.com/problems/valid-anagram/description/
valid anagramhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_242/ValidAnagram.java
设计循环双端队列https://leetcode-cn.com/problems/design-circular-deque/
括号生成https://leetcode-cn.com/problems/generate-parentheses/
二叉树的中序遍历https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/
binary tree inorder traversalhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_94/BinaryTreeInorderTraversal.java
验证二叉搜索树https://leetcode-cn.com/problems/validate-binary-search-tree
validate binary search treehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_98/ValidateBinarySearchTree.java
二叉树的最大深度https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
maximum depth of binary treehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_104/MaximumDepthOfBinaryTree.java
从前序与中序遍历序列构造二叉树https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
construct binary treehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_105/ConstructBinaryTreeFromPreorderAndInorderTraversal.java
二叉树的最小深度https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
minimum depth of binary treehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_111/MinimumDepthOfBinaryTree.java
二叉树的前序遍历https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/
binary tree preorder traversalhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_144/BinaryTreePreorderTraversal.java
翻转二叉树https://leetcode-cn.com/problems/invert-binary-tree/description/
invert binary treehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_226/InvertBinaryTree.java
二叉搜索树中第K小的元素https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/comments/
二叉树的最近公共祖先https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
lowest common ancestorhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_236/LowestCommonAncestorOfABinaryTree.java
二叉树的序列化与反序列化https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/
N叉树的层序遍历https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/description/
n ary tree level order traversalhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_429/NAryTreeLevelOrderTraversal.java
N叉树的前序遍历https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/description
N叉树的后序遍历https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/description/
电话号码的字母组合https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/
Pow(x, n)https://leetcode-cn.com/problems/powx-n/description/
pow x - nhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_50/PowXN.java
子集https://leetcode-cn.com/problems/subsets/solution/hui-su-jie-fa-by-jawhiow/
subsetshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_78/Subsets.java
求众数https://leetcode-cn.com/problems/majority-element/description/
搜索旋转排序数组https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
search in rotated sorted arrayhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_33/SearchInRotatedSortedArray.java
x 的平方根https://leetcode-cn.com/problems/sqrtx/%E2%80%A8
sqrtxhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_69/Sqrtx.java
有效的完全平方数https://leetcode-cn.com/problems/valid-perfect-square/
valid perfect squarehttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_367/ValidPerfectSquare.java
被围绕的区域https://leetcode-cn.com/problems/surrounded-regions/#/description
岛屿数量https://leetcode-cn.com/problems/number-of-islands/
number of islandshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_200/NumberOfIslands.java
朋友圈https://leetcode-cn.com/problems/friend-circles/#/description
二叉树的层次遍历https://leetcode-cn.com/problems/binary-tree-level-order-traversal/#/description
binary tree level order traversalhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_102/BinaryTreeLevelOrderTraversal.java
单词接龙 IIhttps://leetcode-cn.com/problems/word-ladder-ii/description/
单词接龙https://leetcode-cn.com/problems/word-ladder/description/
最小基因变化https://leetcode-cn.com/problems/minimum-genetic-mutation/#/description
在每个树行中找最大值https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/#/description
扫雷游戏https://leetcode-cn.com/problems/minesweeper/description/
最长有效括号https://leetcode-cn.com/problems/longest-valid-parentheses/
跳跃游戏 II https://leetcode-cn.com/problems/jump-game-ii/
跳跃游戏 https://leetcode-cn.com/problems/jump-game/
不同路径 https://leetcode-cn.com/problems/unique-paths/
unique pathshttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_62/UniquePaths.java
不同路径 II https://leetcode-cn.com/problems/unique-paths-ii/
unique paths IIhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_63/UniquePathsII.java
最小路径和 https://leetcode-cn.com/problems/minimum-path-sum/
编辑距离 https://leetcode-cn.com/problems/edit-distance/
最小覆盖子串https://leetcode-cn.com/problems/minimum-window-substring/
解码方法https://leetcode-cn.com/problems/decode-ways
三角形最小路径和https://leetcode-cn.com/problems/triangle/description/
买卖股票的最佳时机https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description
best time to buy and shell stockhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_121/BestTimeToBuyAndSellStock.java
买卖股票的最佳时机 IIhttps://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
best time to buy and shell stock iihttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_122/BestTimeToBuyAndSellStockII.java
买卖股票的最佳时机 IIIhttps://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
乘积最大子序列https://leetcode-cn.com/problems/maximum-product-subarray/description/
买卖股票的最佳时机 IVhttps://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
打家劫舍https://leetcode-cn.com/problems/house-robber/
house robberhttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_198/HouseRobber.java
打家劫舍 IIhttps://leetcode-cn.com/problems/house-robber-ii/description/
house robber iihttps://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_213/HouseRobberII.java
最大正方形https://leetcode-cn.com/problems/maximal-square/
完全平方数https://leetcode-cn.com/problems/perfect-squares/
零钱兑换https://leetcode-cn.com/problems/coin-change/description/
零钱兑换 IIhttps://leetcode-cn.com/problems/coin-change-2/
最佳买卖股票时机含冷冻期https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
戳气球https://leetcode-cn.com/problems/burst-balloons/
矩形区域不超过 K 的最大数值和https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/
青蛙过河https://leetcode-cn.com/problems/frog-jump/
分割数组的最大值https://leetcode-cn.com/problems/split-array-largest-sum
学生出勤记录 IIhttps://leetcode-cn.com/problems/student-attendance-record-ii/
任务调度器https://leetcode-cn.com/problems/task-scheduler/
回文子串https://leetcode-cn.com/problems/palindromic-substrings/
买卖股票的最佳时机含手续费https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
不同路径 III https://leetcode-cn.com/problems/unique-paths-iii/
有效的数独https://leetcode-cn.com/problems/valid-sudoku/description/
解数独https://leetcode-cn.com/problems/sudoku-solver/#/description
N皇后https://leetcode-cn.com/problems/n-queens/
分发饼干https://leetcode-cn.com/problems/assign-cookies/description/
柠檬水找零https://leetcode-cn.com/problems/lemonade-change/description/
模拟行走机器人https://leetcode-cn.com/problems/walking-robot-simulation/description/
实现 Trie (前缀树) https://leetcode-cn.com/problems/implement-trie-prefix-tree/#/description
单词搜索 II https://leetcode-cn.com/problems/word-search-ii/
N皇后 II https://leetcode-cn.com/problems/n-queens-ii/description/
颠倒二进制位https://leetcode-cn.com/problems/reverse-bits/
位1的个数https://leetcode-cn.com/problems/number-of-1-bits/
2的幂https://leetcode-cn.com/problems/power-of-two/
比特位计数https://leetcode-cn.com/problems/counting-bits/description/
LRU缓存机制https://leetcode-cn.com/problems/lru-cache/#/
https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#你可能感兴趣的经典话题
01背包问题https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E8%83%8C%E5%8C%85/backpack.md
Readme https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#readme-ov-file
Contributing https://patch-diff.githubusercontent.com/itdoudoutech/LeetCode#contributing-ov-file
Please reload this pagehttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode
Activityhttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/activity
0 starshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/stargazers
0 watchinghttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/watchers
0 forkshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fitdoudoutech%2FLeetCode&report=itdoudoutech+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/itdoudoutech/LeetCode/releases
Packages 0https://patch-diff.githubusercontent.com/users/itdoudoutech/packages?repo_name=LeetCode
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.