René's URL Explorer Experiment


Title: GitHub - NIGHTFIGHTING/algorithm · GitHub

Open Graph Title: GitHub - NIGHTFIGHTING/algorithm

X Title: GitHub - NIGHTFIGHTING/algorithm

Description: Contribute to NIGHTFIGHTING/algorithm development by creating an account on GitHub.

Open Graph Description: Contribute to NIGHTFIGHTING/algorithm development by creating an account on GitHub.

X Description: Contribute to NIGHTFIGHTING/algorithm development by creating an account on GitHub.

Opengraph URL: https://github.com/NIGHTFIGHTING/algorithm

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:ca2a21a1-9515-3e7d-35e1-14e74c95a9a9
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id8F68:1368EB:3B1D8FF:51C8614:6A4F4868
html-safe-nonce5d6951e025111d0f23356ad068f6ac0de4e46e3a491288e34331e05e97b4fea4
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4RjY4OjEzNjhFQjozQjFEOEZGOjUxQzg2MTQ6NkE0RjQ4NjgiLCJ2aXNpdG9yX2lkIjoiNzcxODM2NjQ4Mzk1MzE3NDYzMiIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac7fcf1a39fb950bed44caa0a334252c3075024ba646a1cdc3ceb04c486c5f6d0e
hovercard-subject-tagrepository:186225368
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/NIGHTFIGHTING/algorithm
twitter:imagehttps://opengraph.githubassets.com/699b28567b2931348f1d3b11c314b20090e50bed00eb36e1f3c8faa04d62a21d/NIGHTFIGHTING/algorithm
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/699b28567b2931348f1d3b11c314b20090e50bed00eb36e1f3c8faa04d62a21d/NIGHTFIGHTING/algorithm
og:image:altContribute to NIGHTFIGHTING/algorithm development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noneb92d11c0aa4a77d54ef4af1078b6a15fb5a70a215b30c4ecf28889d5a8e656d9
turbo-cache-controlno-cache
go-importgithub.com/NIGHTFIGHTING/algorithm git https://github.com/NIGHTFIGHTING/algorithm.git
octolytics-dimension-user_id18497531
octolytics-dimension-user_loginNIGHTFIGHTING
octolytics-dimension-repository_id186225368
octolytics-dimension-repository_nwoNIGHTFIGHTING/algorithm
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id165639778
octolytics-dimension-repository_parent_nwohollischuang/algorithm
octolytics-dimension-repository_network_root_id165639778
octolytics-dimension-repository_network_root_nwohollischuang/algorithm
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
release4b249b445842943ed31549e027f57a8ade9881ed
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/NIGHTFIGHTING/algorithm#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FNIGHTFIGHTING%2Falgorithm
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%2FNIGHTFIGHTING%2Falgorithm
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=NIGHTFIGHTING%2Falgorithm
Reloadhttps://github.com/NIGHTFIGHTING/algorithm
Reloadhttps://github.com/NIGHTFIGHTING/algorithm
Reloadhttps://github.com/NIGHTFIGHTING/algorithm
NIGHTFIGHTING https://github.com/NIGHTFIGHTING
algorithmhttps://github.com/NIGHTFIGHTING/algorithm
hollischuang/algorithmhttps://github.com/hollischuang/algorithm
Notifications https://github.com/login?return_to=%2FNIGHTFIGHTING%2Falgorithm
Fork 0 https://github.com/login?return_to=%2FNIGHTFIGHTING%2Falgorithm
Star 0 https://github.com/login?return_to=%2FNIGHTFIGHTING%2Falgorithm
Code https://github.com/NIGHTFIGHTING/algorithm
Pull requests 0 https://github.com/NIGHTFIGHTING/algorithm/pulls
Actions https://github.com/NIGHTFIGHTING/algorithm/actions
Projects https://github.com/NIGHTFIGHTING/algorithm/projects
Security and quality 0 https://github.com/NIGHTFIGHTING/algorithm/security
Insights https://github.com/NIGHTFIGHTING/algorithm/pulse
Code https://github.com/NIGHTFIGHTING/algorithm
Pull requests https://github.com/NIGHTFIGHTING/algorithm/pulls
Actions https://github.com/NIGHTFIGHTING/algorithm/actions
Projects https://github.com/NIGHTFIGHTING/algorithm/projects
Security and quality https://github.com/NIGHTFIGHTING/algorithm/security
Insights https://github.com/NIGHTFIGHTING/algorithm/pulse
https://github.com/NIGHTFIGHTING/algorithm
Brancheshttps://github.com/NIGHTFIGHTING/algorithm/branches
Tagshttps://github.com/NIGHTFIGHTING/algorithm/tags
https://github.com/NIGHTFIGHTING/algorithm/branches
https://github.com/NIGHTFIGHTING/algorithm/tags
550 Commitshttps://github.com/NIGHTFIGHTING/algorithm/commits/master/
https://github.com/NIGHTFIGHTING/algorithm/commits/master/
imageshttps://github.com/NIGHTFIGHTING/algorithm/tree/master/images
imageshttps://github.com/NIGHTFIGHTING/algorithm/tree/master/images
leetcodehttps://github.com/NIGHTFIGHTING/algorithm/tree/master/leetcode
leetcodehttps://github.com/NIGHTFIGHTING/algorithm/tree/master/leetcode
剑指Offerhttps://github.com/NIGHTFIGHTING/algorithm/tree/master/%E5%89%91%E6%8C%87Offer
剑指Offerhttps://github.com/NIGHTFIGHTING/algorithm/tree/master/%E5%89%91%E6%8C%87Offer
.gitignorehttps://github.com/NIGHTFIGHTING/algorithm/blob/master/.gitignore
.gitignorehttps://github.com/NIGHTFIGHTING/algorithm/blob/master/.gitignore
README.mdhttps://github.com/NIGHTFIGHTING/algorithm/blob/master/README.md
README.mdhttps://github.com/NIGHTFIGHTING/algorithm/blob/master/README.md
contribute.mdhttps://github.com/NIGHTFIGHTING/algorithm/blob/master/contribute.md
contribute.mdhttps://github.com/NIGHTFIGHTING/algorithm/blob/master/contribute.md
READMEhttps://github.com/NIGHTFIGHTING/algorithm
https://github.com/NIGHTFIGHTING/algorithm#算法每日一练
leetCodehttps://leetcode-cn.com/problemset/all/
https://github.com/NIGHTFIGHTING/algorithm#初学者友好的算法题目解答
https://github.com/NIGHTFIGHTING/algorithm#专题列表
《算法面试通关40讲》专题https://time.geekbang.org/course/intro/130
《算法面试通关40讲》官方课件https://github.com/geektime-geekbang/algorithm-1
https://github.com/NIGHTFIGHTING/algorithm#专题begin算法面试40讲
206. 反转链表https://github.com/hollischuang/algorithm/tree/master/leetcode/206-reverseLinkedList
https://leetcode-cn.com/problems/reverse-linked-list/https://leetcode-cn.com/problems/reverse-linked-list/
https://leetcode.com/articles/reverse-linked-list/https://leetcode.com/articles/reverse-linked-list/
24. 两两交换链表中的节点https://github.com/hollischuang/algorithm/tree/master/leetcode/024-swapNodesInPairs
https://leetcode-cn.com/problems/swap-nodes-in-pairs/https://leetcode-cn.com/problems/swap-nodes-in-pairs/
https://leetcode.com/problems/swap-nodes-in-pairs/discuss/11030/My-accepted-java-code.-used-recursion.https://leetcode.com/problems/swap-nodes-in-pairs/discuss/11030/My-accepted-java-code.-used-recursion.
141. 环形链表https://github.com/hollischuang/algorithm/tree/master/leetcode/141-linkedListCycle
https://leetcode-cn.com/problems/linked-list-cycle/https://leetcode-cn.com/problems/linked-list-cycle/
https://leetcode-cn.com/articles/linked-list-cycle/https://leetcode-cn.com/articles/linked-list-cycle/
142. 环形链表 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/142-linkedListCycleII
https://leetcode-cn.com/problems/linked-list-cycle-ii/https://leetcode-cn.com/problems/linked-list-cycle-ii/
https://leetcode.com/problems/linked-list-cycle-ii/discuss/44774/Java-O(1)-space-solution-with-detailed-explanation.https://leetcode.com/problems/linked-list-cycle-ii/discuss/44774/Java-O(1)-space-solution-with-detailed-explanation.
25. k个一组翻转链表https://github.com/hollischuang/algorithm/tree/master/leetcode/025-reverseNodesInKGroup
https://leetcode-cn.com/problems/reverse-nodes-in-k-group/https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
https://leetcode.com/problems/reverse-nodes-in-k-group/discuss/11423/Short-but-recursive-Java-code-with-commentshttps://leetcode.com/problems/reverse-nodes-in-k-group/discuss/11423/Short-but-recursive-Java-code-with-comments
20. 有效的括号https://github.com/hollischuang/algorithm/tree/master/leetcode/020-validParentheses
https://leetcode-cn.com/problems/valid-parentheses/https://leetcode-cn.com/problems/valid-parentheses/
https://leetcode-cn.com/articles/valid-parentheses/https://leetcode-cn.com/articles/valid-parentheses/
232. 用栈实现队列https://github.com/hollischuang/algorithm/tree/master/leetcode/232-implementQueueUsingStacks
https://leetcode-cn.com/problems/implement-queue-using-stacks/https://leetcode-cn.com/problems/implement-queue-using-stacks/
https://leetcode.com/articles/implement-queue-using-stacks/https://leetcode.com/articles/implement-queue-using-stacks/
225. 用队列实现栈https://github.com/hollischuang/algorithm/tree/master/leetcode/225-implementStackUsingQueues
https://leetcode-cn.com/problems/implement-stack-using-queues/https://leetcode-cn.com/problems/implement-stack-using-queues/
https://leetcode.com/articles/implement-stack-using-queues/https://leetcode.com/articles/implement-stack-using-queues/
844. 比较含退格的字符串https://github.com/hollischuang/algorithm/tree/master/leetcode/844-BackspaceStringCompare
https://leetcode-cn.com/problems/backspace-string-compare/https://leetcode-cn.com/problems/backspace-string-compare/
https://leetcode.com/articles/backspace-string-compare/https://leetcode.com/articles/backspace-string-compare/
703. 数据流中的第K大元素https://github.com/hollischuang/algorithm/tree/master/leetcode/703-KthLargestElementInAStream
https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/
https://leetcode.com/problems/kth-largest-element-in-a-stream/discuss/149050/Java-Priority-Queuehttps://leetcode.com/problems/kth-largest-element-in-a-stream/discuss/149050/Java-Priority-Queue
692. 前K个高频单词https://github.com/hollischuang/algorithm/tree/master/leetcode/692-TopKFrequentWords
https://leetcode-cn.com/problems/top-k-frequent-words/https://leetcode-cn.com/problems/top-k-frequent-words/
https://leetcode.com/articles/top-k-frequent-words/https://leetcode.com/articles/top-k-frequent-words/
239. 滑动窗口最大值https://github.com/hollischuang/algorithm/tree/master/leetcode/239-slidingWindowMaximum
https://leetcode-cn.com/problems/sliding-window-maximum/https://leetcode-cn.com/problems/sliding-window-maximum/
https://leetcode.com/problems/sliding-window-maximum/discuss/65884/Java-O(n)-solution-using-deque-with-explanationhttps://leetcode.com/problems/sliding-window-maximum/discuss/65884/Java-O(n)-solution-using-deque-with-explanation
242. 有效的字母异位词https://github.com/hollischuang/algorithm/tree/master/leetcode/242-ValidAnagram
https://leetcode-cn.com/problems/valid-anagram/https://leetcode-cn.com/problems/valid-anagram/
https://leetcode.com/articles/valid-anagram/https://leetcode.com/articles/valid-anagram/
1. 两数之和https://github.com/hollischuang/algorithm/tree/master/leetcode/001-twoSum
https://leetcode-cn.com/problems/two-sum/https://leetcode-cn.com/problems/two-sum/
https://leetcode-cn.com/articles/two-sum/https://leetcode-cn.com/articles/two-sum/
15. 三数之和https://github.com/hollischuang/algorithm/tree/master/leetcode/015-threeSum
https://leetcode-cn.com/problems/3sum/https://leetcode-cn.com/problems/3sum/
https://leetcode.com/problems/3sum/discuss/7380/Concise-O(N2)-Java-solutionhttps://leetcode.com/problems/3sum/discuss/7380/Concise-O(N2)-Java-solution
98. 验证二叉搜索树https://github.com/hollischuang/algorithm/tree/master/leetcode/098-validateBinarySearchTree
https://leetcode-cn.com/problems/validate-binary-search-tree/https://leetcode-cn.com/problems/validate-binary-search-tree/
https://leetcode.com/problems/validate-binary-search-tree/discuss/32112/Learn-one-iterative-inorder-traversal-apply-it-to-multiple-tree-questions-(Java-Solution)https://leetcode.com/problems/validate-binary-search-tree/discuss/32112/Learn-one-iterative-inorder-traversal-apply-it-to-multiple-tree-questions-(Java-Solution)
https://leetcode.com/problems/validate-binary-search-tree/discuss/32109/My-simple-Java-solution-in-3-lineshttps://leetcode.com/problems/validate-binary-search-tree/discuss/32109/My-simple-Java-solution-in-3-lines
236. 二叉树的最近公共祖先https://github.com/hollischuang/algorithm/tree/master/leetcode/236-lowestCommonAncestorOfABinaryTree
https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
https://leetcode.com/articles/lowest-common-ancestor-of-a-binary-tree/https://leetcode.com/articles/lowest-common-ancestor-of-a-binary-tree/
50. Pow(x, n)https://github.com/hollischuang/algorithm/tree/master/leetcode/050-powxN
https://leetcode-cn.com/problems/powx-n/https://leetcode-cn.com/problems/powx-n/
https://leetcode.com/problems/powx-n/discuss/19546/Short-and-easy-to-understand-solutionhttps://leetcode.com/problems/powx-n/discuss/19546/Short-and-easy-to-understand-solution
https://leetcode.com/problems/powx-n/discuss/19544/5-different-choices-when-talk-with-interviewershttps://leetcode.com/problems/powx-n/discuss/19544/5-different-choices-when-talk-with-interviewers
169. 求众数https://github.com/hollischuang/algorithm/tree/master/leetcode/169-majorityElement
https://leetcode-cn.com/problems/majority-element/https://leetcode-cn.com/problems/majority-element/
https://leetcode.com/articles/majority-element/https://leetcode.com/articles/majority-element/
53. 最大子序和https://github.com/hollischuang/algorithm/tree/master/leetcode/053-maximumSubarray
https://leetcode-cn.com/problems/maximum-subarray/https://leetcode-cn.com/problems/maximum-subarray/
https://leetcode.com/problems/maximum-subarray/discuss/20193/DP-solution-and-some-thoughtshttps://leetcode.com/problems/maximum-subarray/discuss/20193/DP-solution-and-some-thoughts
https://leetcode.com/problems/maximum-subarray/discuss/20211/Accepted-O(n)-solution-in-javahttps://leetcode.com/problems/maximum-subarray/discuss/20211/Accepted-O(n)-solution-in-java
860. 柠檬水找零https://github.com/hollischuang/algorithm/tree/master/leetcode/860-lemonadeChange
https://leetcode-cn.com/problems/lemonade-change/https://leetcode-cn.com/problems/lemonade-change/
https://leetcode-cn.com/articles/lemonade-change/https://leetcode-cn.com/articles/lemonade-change/
122. 买卖股票的最佳时机 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/122-bestTimeToBuyAndSellStockII
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
https://leetcode-cn.com/articles/best-time-to-buy-and-sell-stock-ii/https://leetcode-cn.com/articles/best-time-to-buy-and-sell-stock-ii/
455. 分发饼干https://github.com/hollischuang/algorithm/tree/master/leetcode/455-AssignCookies
https://leetcode-cn.com/problems/assign-cookies/https://leetcode-cn.com/problems/assign-cookies/
https://leetcode.com/problems/assign-cookies/discuss/93987/Simple-Greedy-Java-Solutionhttps://leetcode.com/problems/assign-cookies/discuss/93987/Simple-Greedy-Java-Solution
https://leetcode.com/problems/assign-cookies/discuss/93997/Array-sort-%2B-Two-pointer-greedy-solution-O(nlogn)https://leetcode.com/problems/assign-cookies/discuss/93997/Array-sort-%2B-Two-pointer-greedy-solution-O(nlogn)
874. 模拟行走机器人https://github.com/hollischuang/algorithm/tree/master/leetcode/874-walkingRobotSimulation
https://leetcode-cn.com/problems/walking-robot-simulation/https://leetcode-cn.com/problems/walking-robot-simulation/
https://leetcode.com/problems/walking-robot-simulation/solution/https://leetcode.com/problems/walking-robot-simulation/solution/
102. 二叉树的层次遍历https://github.com/hollischuang/algorithm/tree/master/leetcode/102-BinaryTreeLevelOrderTraversal
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
https://leetcode.com/problems/binary-tree-level-order-traversal/discuss/33450/Java-solution-with-a-queue-usedhttps://leetcode.com/problems/binary-tree-level-order-traversal/discuss/33450/Java-solution-with-a-queue-used
https://leetcode.com/problems/binary-tree-level-order-traversal/discuss/33445/Java-Solution-using-DFShttps://leetcode.com/problems/binary-tree-level-order-traversal/discuss/33445/Java-Solution-using-DFS
104. 二叉树的最大深度https://github.com/hollischuang/algorithm/tree/master/leetcode/104-MaximumDepthOfBinaryTree
https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
https://leetcode-cn.com/articles/maximum-depth-of-binary-tree/https://leetcode-cn.com/articles/maximum-depth-of-binary-tree/
51. N-皇后https://github.com/hollischuang/algorithm/tree/master/leetcode/051-NQueens
https://leetcode-cn.com/problems/n-queens/https://leetcode-cn.com/problems/n-queens/
https://leetcode.com/problems/n-queens/discuss/19805/My-easy-understanding-Java-Solutionhttps://leetcode.com/problems/n-queens/discuss/19805/My-easy-understanding-Java-Solution
https://leetcode.com/problems/n-queens/discuss/19808/Accepted-4ms-c%2B%2B-solution-use-backtracking-and-bitmask-easy-understand.https://leetcode.com/problems/n-queens/discuss/19808/Accepted-4ms-c%2B%2B-solution-use-backtracking-and-bitmask-easy-understand.
36. 有效的数独https://github.com/hollischuang/algorithm/tree/master/leetcode/036-ValidSudoku
https://leetcode-cn.com/problems/valid-sudoku/https://leetcode-cn.com/problems/valid-sudoku/
https://leetcode.com/problems/valid-sudoku/discuss/15472/Short%2BSimple-Java-using-Stringshttps://leetcode.com/problems/valid-sudoku/discuss/15472/Short%2BSimple-Java-using-Strings
https://leetcode.com/problems/valid-sudoku/discuss/15450/Shared-my-concise-Java-codehttps://leetcode.com/problems/valid-sudoku/discuss/15450/Shared-my-concise-Java-code
37. 解数独https://github.com/hollischuang/algorithm/tree/master/leetcode/037-SudokuSolver
https://leetcode-cn.com/problems/sudoku-solver/https://leetcode-cn.com/problems/sudoku-solver/
https://leetcode.com/problems/sudoku-solver/discuss/15752/Straight-Forward-Java-Solution-Using-Backtrackinghttps://leetcode.com/problems/sudoku-solver/discuss/15752/Straight-Forward-Java-Solution-Using-Backtracking
69. x 的平方根https://github.com/hollischuang/algorithm/tree/master/leetcode/069-SqrtX
https://leetcode-cn.com/problems/sqrtx/https://leetcode-cn.com/problems/sqrtx/
https://leetcode.com/problems/sqrtx/discuss/25047/A-Binary-Search-Solutionhttps://leetcode.com/problems/sqrtx/discuss/25047/A-Binary-Search-Solution
367. 有效的完全平方数https://github.com/hollischuang/algorithm/tree/master/leetcode/367-ValidPerfectSquare
https://leetcode-cn.com/problems/valid-perfect-square/https://leetcode-cn.com/problems/valid-perfect-square/
https://leetcode.com/problems/valid-perfect-square/discuss/83874/A-square-number-is-1%2B3%2B5%2B7%2B...-JAVA-codehttps://leetcode.com/problems/valid-perfect-square/discuss/83874/A-square-number-is-1%2B3%2B5%2B7%2B...-JAVA-code
208. 实现 Trie (前缀树)https://github.com/hollischuang/algorithm/tree/master/leetcode/208-implementTriePrefixTree
https://leetcode-cn.com/problems/implement-trie-prefix-tree/https://leetcode-cn.com/problems/implement-trie-prefix-tree/
https://leetcode.com/articles/implement-trie-prefix-tree/https://leetcode.com/articles/implement-trie-prefix-tree/
212. 单词搜索 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/212-wordSearchII
https://leetcode-cn.com/problems/word-search-ii/https://leetcode-cn.com/problems/word-search-ii/
https://leetcode.com/problems/word-search-ii/discuss/59780/Java-15ms-Easiest-Solution-(100.00)https://leetcode.com/problems/word-search-ii/discuss/59780/Java-15ms-Easiest-Solution-(100.00)
191. 位1的个数https://github.com/hollischuang/algorithm/tree/master/leetcode/191-NumberOf1Bits
https://leetcode-cn.com/problems/number-of-1-bits/https://leetcode-cn.com/problems/number-of-1-bits/
https://leetcode.com/articles/number-1-bits/https://leetcode.com/articles/number-1-bits/
338. 比特位计数https://github.com/hollischuang/algorithm/tree/master/leetcode/338-CountingBits
https://leetcode-cn.com/problems/counting-bits/https://leetcode-cn.com/problems/counting-bits/
https://leetcode.com/problems/counting-bits/discuss/79539/Three-Line-Java-Solutionhttps://leetcode.com/problems/counting-bits/discuss/79539/Three-Line-Java-Solution
231. 2的幂https://github.com/hollischuang/algorithm/tree/master/leetcode/231-PowerOfTwo
https://leetcode-cn.com/problems/power-of-two/https://leetcode-cn.com/problems/power-of-two/
https://leetcode.com/problems/power-of-two/discuss/63972/One-line-java-solution-using-bitCounthttps://leetcode.com/problems/power-of-two/discuss/63972/One-line-java-solution-using-bitCount
52. N皇后 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/052-N-QueensII
https://leetcode-cn.com/problems/n-queens-ii/https://leetcode-cn.com/problems/n-queens-ii/
https://leetcode.com/problems/n-queens-ii/discuss/20058/Accepted-Java-Solutionhttps://leetcode.com/problems/n-queens-ii/discuss/20058/Accepted-Java-Solution
https://leetcode.com/problems/n-queens-ii/discuss/20048/Easiest-Java-Solution-(1ms-98.22)https://leetcode.com/problems/n-queens-ii/discuss/20048/Easiest-Java-Solution-(1ms-98.22)
70. 爬楼梯https://github.com/hollischuang/algorithm/tree/master/leetcode/070-ClimbingStairs
https://leetcode-cn.com/problems/climbing-stairs/https://leetcode-cn.com/problems/climbing-stairs/
https://leetcode.com/articles/climbing-stairs/https://leetcode.com/articles/climbing-stairs/
120. 三角形最小路径和https://github.com/hollischuang/algorithm/tree/master/leetcode/120-Triangle
https://leetcode-cn.com/problems/triangle/https://leetcode-cn.com/problems/triangle/
https://leetcode.com/problems/triangle/discuss/38730/DP-Solution-for-Trianglehttps://leetcode.com/problems/triangle/discuss/38730/DP-Solution-for-Triangle
https://leetcode.com/problems/triangle/discuss/38724/7-lines-neat-Java-Solutionhttps://leetcode.com/problems/triangle/discuss/38724/7-lines-neat-Java-Solution
152. 乘积最大子序列https://github.com/hollischuang/algorithm/tree/master/leetcode/152-MaximumProductSubarray
https://leetcode-cn.com/problems/maximum-product-subarray/https://leetcode-cn.com/problems/maximum-product-subarray/
https://leetcode.com/problems/maximum-product-subarray/discuss/48230/Possibly-simplest-solution-with-O(n)-time-complexityhttps://leetcode.com/problems/maximum-product-subarray/discuss/48230/Possibly-simplest-solution-with-O(n)-time-complexity
https://leetcode.com/problems/maximum-product-subarray/discuss/48252/Sharing-my-solution%3A-O(1)-space-O(n)-running-timehttps://leetcode.com/problems/maximum-product-subarray/discuss/48252/Sharing-my-solution%3A-O(1)-space-O(n)-running-time
123. 买卖股票的最佳时机 IIIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/123-BestTimeToBuyAndSellStockIII
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/39611/Is-it-Best-Solution-with-O(n)-O(1).https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/39611/Is-it-Best-Solution-with-O(n)-O(1).
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/135704/Detail-explanation-of-DP-solutionhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/135704/Detail-explanation-of-DP-solution
121. 买卖股票的最佳时机https://github.com/hollischuang/algorithm/tree/master/leetcode/121-bestTimeToBuyAndSellStock
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/
https://leetcode-cn.com/articles/best-time-to-buy-and-sell-stock/https://leetcode-cn.com/articles/best-time-to-buy-and-sell-stock/
188. 买卖股票的最佳时机 IVhttps://github.com/hollischuang/algorithm/tree/master/leetcode/188-bestTimeToBuyAndSellStockIV
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/54113/A-Concise-DP-Solution-in-Javahttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/54113/A-Concise-DP-Solution-in-Java
309. 最佳买卖股票时机含冷冻期https://github.com/hollischuang/algorithm/tree/master/leetcode/309-BestTimeToBuyAndSellStockWithCooldown
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/discuss/75927/Share-my-thinking-processhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/discuss/75927/Share-my-thinking-process
714. 买卖股票的最佳时机含手续费https://github.com/hollischuang/algorithm/tree/master/leetcode/714-BestTimeToBuyAndSellStockWithTransactionFee
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
https://leetcode.com/articles/best-time-to-buy-and-sell-stock-with-transaction-fee/https://leetcode.com/articles/best-time-to-buy-and-sell-stock-with-transaction-fee/
300. 最长上升子序列https://github.com/hollischuang/algorithm/tree/master/leetcode/300-LongestIncreasingSubsequence
https://leetcode-cn.com/problems/longest-increasing-subsequence/https://leetcode-cn.com/problems/longest-increasing-subsequence/
https://leetcode.com/articles/longest-increasing-subsequence/https://leetcode.com/articles/longest-increasing-subsequence/
322. 零钱兑换https://github.com/hollischuang/algorithm/tree/master/leetcode/322-CoinChange
https://leetcode-cn.com/problems/coin-change/https://leetcode-cn.com/problems/coin-change/
https://leetcode.com/articles/coin-change/https://leetcode.com/articles/coin-change/
72. 编辑距离https://github.com/hollischuang/algorithm/tree/master/leetcode/072-EditDistance
https://leetcode-cn.com/problems/edit-distance/https://leetcode-cn.com/problems/edit-distance/
https://leetcode.com/articles/edit-distance/https://leetcode.com/articles/edit-distance/
200. 岛屿的个数https://github.com/hollischuang/algorithm/tree/master/leetcode/200-numberOfIslands
https://leetcode-cn.com/problems/number-of-islands/https://leetcode-cn.com/problems/number-of-islands/
https://leetcode.com/problems/number-of-islands/discuss/56359/Very-concise-Java-AC-solutionhttps://leetcode.com/problems/number-of-islands/discuss/56359/Very-concise-Java-AC-solution
547. 朋友圈https://github.com/hollischuang/algorithm/tree/master/leetcode/547-friendCircles
https://leetcode-cn.com/problems/friend-circles/https://leetcode-cn.com/problems/friend-circles/
https://leetcode.com/problems/friend-circles/discuss/101338/Neat-DFS-java-solutionhttps://leetcode.com/problems/friend-circles/discuss/101338/Neat-DFS-java-solution
https://leetcode.com/problems/friend-circles/discuss/101336/Java-solution-Union-Findhttps://leetcode.com/problems/friend-circles/discuss/101336/Java-solution-Union-Find
146. LRU缓存机制https://github.com/hollischuang/algorithm/tree/master/leetcode/146-lruCache
https://leetcode-cn.com/problems/lru-cache/https://leetcode-cn.com/problems/lru-cache/
https://leetcode.com/problems/lru-cache/discuss/45911/Java-Hashtable-%2B-Double-linked-list-(with-a-touch-of-pseudo-nodes)https://leetcode.com/problems/lru-cache/discuss/45911/Java-Hashtable-%2B-Double-linked-list-(with-a-touch-of-pseudo-nodes)
https://github.com/NIGHTFIGHTING/algorithm#专题end算法面试40讲
https://github.com/NIGHTFIGHTING/algorithm#专题begin动态规划
303. 区域和检索 - 数组不可变https://github.com/hollischuang/algorithm/tree/master/leetcode/303-rangeSumQueryImmutable
https://leetcode-cn.com/problems/range-sum-query-immutable/https://leetcode-cn.com/problems/range-sum-query-immutable/
https://leetcode.com/articles/range-sum-query-immutable/https://leetcode.com/articles/range-sum-query-immutable/
746. 使用最小花费爬楼梯https://github.com/hollischuang/algorithm/tree/master/leetcode/746-minCostClimbingStairs
https://leetcode-cn.com/problems/min-cost-climbing-stairs/https://leetcode-cn.com/problems/min-cost-climbing-stairs/
https://leetcode.com/articles/min-cost-climbing-stairs/https://leetcode.com/articles/min-cost-climbing-stairs/
198. 打家劫舍https://github.com/hollischuang/algorithm/tree/master/leetcode/198-houseRobber
https://leetcode-cn.com/problems/house-robber/https://leetcode-cn.com/problems/house-robber/
https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-of-DP-problems.https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-of-DP-problems.
877. 石子游戏https://github.com/hollischuang/algorithm/tree/master/leetcode/877-stoneGame
https://leetcode-cn.com/problems/stone-game/https://leetcode-cn.com/problems/stone-game/
https://leetcode-cn.com/articles/stone-game/https://leetcode-cn.com/articles/stone-game/
64. 最小路径和https://github.com/hollischuang/algorithm/tree/master/leetcode/064-minimumPathSum
https://leetcode-cn.com/problems/minimum-path-sum/https://leetcode-cn.com/problems/minimum-path-sum/
https://leetcode.com/problems/minimum-path-sum/discuss/23471/My-java-solution-using-DP-and-no-extra-spacehttps://leetcode.com/problems/minimum-path-sum/discuss/23471/My-java-solution-using-DP-and-no-extra-space
96. 不同的二叉搜索树https://github.com/hollischuang/algorithm/tree/master/leetcode/096-uniqueBinarySearchTrees
https://leetcode-cn.com/problems/unique-binary-search-trees/https://leetcode-cn.com/problems/unique-binary-search-trees/
https://leetcode.com/articles/unique-binary-search-trees/https://leetcode.com/articles/unique-binary-search-trees/
413. 等差数列划分https://github.com/hollischuang/algorithm/tree/master/leetcode/413-arithmeticSlices
https://leetcode-cn.com/problems/arithmetic-slices/https://leetcode-cn.com/problems/arithmetic-slices/
https://leetcode.com/articles/arithmetic-slices/https://leetcode.com/articles/arithmetic-slices/
712. 两个字符串的最小ASCII删除和https://github.com/hollischuang/algorithm/tree/master/leetcode/712-MinimumASCIIDeleteSumforTwoStrings
https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings/https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings/
https://leetcode.com/articles/minimum-ascii-delete-sum-for-two-strings/https://leetcode.com/articles/minimum-ascii-delete-sum-for-two-strings/
62. 不同路径https://github.com/hollischuang/algorithm/tree/master/leetcode/062-UniquePaths
https://leetcode-cn.com/problems/unique-paths/https://leetcode-cn.com/problems/unique-paths/
https://leetcode.com/problems/unique-paths/discuss/22958/Math-solution-O(1)-spacehttps://leetcode.com/problems/unique-paths/discuss/22958/Math-solution-O(1)-space
https://leetcode.com/problems/unique-paths/discuss/22953/Java-DP-solution-with-complexity-O(n*m)https://leetcode.com/problems/unique-paths/discuss/22953/Java-DP-solution-with-complexity-O(n*m)
638. 大礼包https://github.com/hollischuang/algorithm/tree/master/leetcode/638-ShoppingOffers
https://leetcode-cn.com/problems/shopping-offers/https://leetcode-cn.com/problems/shopping-offers/
https://leetcode.com/articles/shopping-offers/https://leetcode.com/articles/shopping-offers/
647. 回文子串https://github.com/hollischuang/algorithm/tree/master/leetcode/647-PalindromicSubstrings
https://leetcode-cn.com/problems/palindromic-substrings/https://leetcode-cn.com/problems/palindromic-substrings/
https://leetcode.com/articles/palindromic-substrings/https://leetcode.com/articles/palindromic-substrings/
931. 下降路径最小和https://github.com/hollischuang/algorithm/tree/master/leetcode/931-MinimumFallingPathSum
https://leetcode-cn.com/problems/minimum-falling-path-sum/https://leetcode-cn.com/problems/minimum-falling-path-sum/
https://leetcode.com/articles/minimum-path-falling-sum/https://leetcode.com/articles/minimum-path-falling-sum/
343. 整数拆分https://github.com/hollischuang/algorithm/tree/master/leetcode/343-IntegerBreak
https://leetcode-cn.com/problems/integer-break/https://leetcode-cn.com/problems/integer-break/
https://leetcode.com/problems/integer-break/discuss/80689/A-simple-explanation-of-the-math-part-and-a-O(n)-solutionhttps://leetcode.com/problems/integer-break/discuss/80689/A-simple-explanation-of-the-math-part-and-a-O(n)-solution
95. 不同的二叉搜索树 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/095-UniqueBinarySearchTreesII
https://leetcode-cn.com/problems/unique-binary-search-trees-ii/https://leetcode-cn.com/problems/unique-binary-search-trees-ii/
https://leetcode.com/articles/unique-binary-search-trees-ii/https://leetcode.com/articles/unique-binary-search-trees-ii/
740. 删除与获得点数https://github.com/hollischuang/algorithm/tree/master/leetcode/740-DeleteAndEarn
https://leetcode-cn.com/problems/delete-and-earn/https://leetcode-cn.com/problems/delete-and-earn/
https://leetcode.com/articles/delete-and-earn/https://leetcode.com/articles/delete-and-earn/
646. 最长数对链https://github.com/hollischuang/algorithm/tree/master/leetcode/646-MaximumLengthOfPairChain
https://leetcode-cn.com/problems/maximum-length-of-pair-chain/https://leetcode-cn.com/problems/maximum-length-of-pair-chain/
https://leetcode.com/articles/maximum-length-of-pair-chain/https://leetcode.com/articles/maximum-length-of-pair-chain/
764. 最大加号标志https://github.com/hollischuang/algorithm/tree/master/leetcode/764-LargestPlusSign
https://leetcode-cn.com/problems/largest-plus-sign/https://leetcode-cn.com/problems/largest-plus-sign/
https://leetcode.com/articles/largest-plus-sign/https://leetcode.com/articles/largest-plus-sign/
279. 完全平方数https://github.com/hollischuang/algorithm/tree/master/leetcode/279-PerfectSquares
https://leetcode-cn.com/problems/perfect-squares/https://leetcode-cn.com/problems/perfect-squares/
https://leetcode.com/problems/perfect-squares/discuss/71495/An-easy-understanding-DP-solution-in-Javahttps://leetcode.com/problems/perfect-squares/discuss/71495/An-easy-understanding-DP-solution-in-Java
392. 判断子序列https://github.com/hollischuang/algorithm/tree/master/leetcode/392-IsSubsequence
https://leetcode-cn.com/problems/is-subsequence/https://leetcode-cn.com/problems/is-subsequence/
https://leetcode.com/problems/is-subsequence/discuss/87302/Binary-search-solution-for-follow-up-with-detailed-commentshttps://leetcode.com/problems/is-subsequence/discuss/87302/Binary-search-solution-for-follow-up-with-detailed-comments
377. 组合总和 Ⅳhttps://github.com/hollischuang/algorithm/tree/master/leetcode/377-CombinationSumIV
https://leetcode-cn.com/problems/combination-sum-iv/https://leetcode-cn.com/problems/combination-sum-iv/
https://leetcode.com/problems/combination-sum-iv/discuss/85036/1ms-Java-DP-Solution-with-Detailed-Explanationhttps://leetcode.com/problems/combination-sum-iv/discuss/85036/1ms-Java-DP-Solution-with-Detailed-Explanation
486. 预测赢家https://github.com/hollischuang/algorithm/tree/master/leetcode/486-PredictTheWinner
https://leetcode-cn.com/problems/predict-the-winner/https://leetcode-cn.com/problems/predict-the-winner/
https://leetcode.com/articles/predict-the-winner/https://leetcode.com/articles/predict-the-winner/
357. 计算各个位数不同的数字个数https://github.com/hollischuang/algorithm/tree/master/leetcode/357-CountNumbersWithUniqueDigits
https://leetcode-cn.com/problems/count-numbers-with-unique-digits/https://leetcode-cn.com/problems/count-numbers-with-unique-digits/
https://leetcode.com/problems/count-numbers-with-unique-digits/discuss/83041/JAVA-DP-O(1)-solution.https://leetcode.com/problems/count-numbers-with-unique-digits/discuss/83041/JAVA-DP-O(1)-solution.
494. 目标和https://github.com/hollischuang/algorithm/tree/master/leetcode/494-TargetSum
https://leetcode-cn.com/problems/target-sum/https://leetcode-cn.com/problems/target-sum/
https://leetcode.com/articles/target-sum/https://leetcode.com/articles/target-sum/
516. 最长回文子序列https://github.com/hollischuang/algorithm/tree/master/leetcode/516-LongestPalindromicSubsequence
https://leetcode-cn.com/problems/longest-palindromic-subsequence/https://leetcode-cn.com/problems/longest-palindromic-subsequence/
https://leetcode.com/problems/longest-palindromic-subsequence/discuss/99101/Straight-forward-Java-DP-solutionhttps://leetcode.com/problems/longest-palindromic-subsequence/discuss/99101/Straight-forward-Java-DP-solution
688. “马”在棋盘上的概率https://github.com/hollischuang/algorithm/tree/master/leetcode/688-KnightProbabilityInChessboard
https://leetcode-cn.com/problems/knight-probability-in-chessboard/https://leetcode-cn.com/problems/knight-probability-in-chessboard/
https://leetcode.com/articles/knight-probability-in-chessboard/https://leetcode.com/articles/knight-probability-in-chessboard/
718. 最长重复子数组https://github.com/hollischuang/algorithm/tree/master/leetcode/718-MaximumLengthOfRepeatedSubarray
https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/
https://leetcode.com/articles/maximum-length-of-repeated-subarray/https://leetcode.com/articles/maximum-length-of-repeated-subarray/
650. 只有两个键的键盘https://github.com/hollischuang/algorithm/tree/master/leetcode/650-2KeysKeyboard
https://leetcode-cn.com/problems/2-keys-keyboard/https://leetcode-cn.com/problems/2-keys-keyboard/
https://leetcode.com/articles/2-keys-keyboard/https://leetcode.com/articles/2-keys-keyboard/
873. 最长的斐波那契子序列的长度https://github.com/hollischuang/algorithm/tree/master/leetcode/873-LengthOfLongestFibonacciSubsequence
https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence/https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence/
https://leetcode-cn.com/articles/length-of-longest-fibonacci-subsequence/https://leetcode-cn.com/articles/length-of-longest-fibonacci-subsequence/
139. 单词拆分https://github.com/hollischuang/algorithm/tree/master/leetcode/139-WordBreak
https://leetcode-cn.com/problems/word-break/https://leetcode-cn.com/problems/word-break/
https://leetcode.com/problems/word-break/discuss/43790/Java-implementation-using-DP-in-two-wayshttps://leetcode.com/problems/word-break/discuss/43790/Java-implementation-using-DP-in-two-ways
264. 丑数 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/264-UglyNumberII
https://leetcode-cn.com/problems/ugly-number-ii/https://leetcode-cn.com/problems/ugly-number-ii/
https://leetcode.com/problems/ugly-number-ii/discuss/69362/O(n)-Java-solutionhttps://leetcode.com/problems/ugly-number-ii/discuss/69362/O(n)-Java-solution
416. 分割等和子集https://github.com/hollischuang/algorithm/tree/master/leetcode/416-PartitionEqualSubsetSum
https://leetcode-cn.com/problems/partition-equal-subset-sum/https://leetcode-cn.com/problems/partition-equal-subset-sum/
https://leetcode.com/problems/partition-equal-subset-sum/discuss/90592/01-knapsack-detailed-explanationhttps://leetcode.com/problems/partition-equal-subset-sum/discuss/90592/01-knapsack-detailed-explanation
https://leetcode.com/problems/partition-equal-subset-sum/discuss/90627/Java-Solution-similar-to-backpack-problem-Easy-to-understandhttps://leetcode.com/problems/partition-equal-subset-sum/discuss/90627/Java-Solution-similar-to-backpack-problem-Easy-to-understand
304. 二维区域和检索 - 矩阵不可变https://github.com/hollischuang/algorithm/tree/master/leetcode/304-RangeSumQuery2DImmutable
https://leetcode-cn.com/problems/range-sum-query-2d-immutable/https://leetcode-cn.com/problems/range-sum-query-2d-immutable/
https://leetcode.com/articles/range-sum-query-2d-immutable/https://leetcode.com/articles/range-sum-query-2d-immutable/
221. 最大正方形https://github.com/hollischuang/algorithm/tree/master/leetcode/221-MaximalSquare
https://leetcode-cn.com/problems/maximal-square/https://leetcode-cn.com/problems/maximal-square/
https://leetcode.com/articles/maximal-square/https://leetcode.com/articles/maximal-square/
698. 划分为k个相等的子集https://github.com/hollischuang/algorithm/tree/master/leetcode/698-PartitionToKEqualSumSubsets
https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets/https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets/
https://leetcode.com/articles/partition-to-k-equal-sum-subsets/https://leetcode.com/articles/partition-to-k-equal-sum-subsets/
474. 一和零https://github.com/hollischuang/algorithm/tree/master/leetcode/474-OnesAndZeroes
https://leetcode-cn.com/problems/ones-and-zeroes/https://leetcode-cn.com/problems/ones-and-zeroes/
https://leetcode.com/problems/ones-and-zeroes/discuss/95807/0-1-knapsack-detailed-explanation.https://leetcode.com/problems/ones-and-zeroes/discuss/95807/0-1-knapsack-detailed-explanation.
https://leetcode.com/problems/ones-and-zeroes/discuss/95811/Java-Iterative-DP-Solution-O(mn)-Spacehttps://leetcode.com/problems/ones-and-zeroes/discuss/95811/Java-Iterative-DP-Solution-O(mn)-Space
838. 推多米诺https://github.com/hollischuang/algorithm/tree/master/leetcode/838-PushDominoes
https://leetcode-cn.com/problems/push-dominoes/https://leetcode-cn.com/problems/push-dominoes/
https://leetcode.com/articles/push-dominoes/https://leetcode.com/articles/push-dominoes/
790. 多米诺和托米诺平铺https://github.com/hollischuang/algorithm/tree/master/leetcode/790-DominoAndTrominoTiling
https://leetcode-cn.com/problems/domino-and-tromino-tiling/https://leetcode-cn.com/problems/domino-and-tromino-tiling/
https://leetcode.com/problems/domino-and-tromino-tiling/discuss/116581/Detail-and-explanation-of-O(n)-solution-why-dpn2*dn-1%2Bdpn-3https://leetcode.com/problems/domino-and-tromino-tiling/discuss/116581/Detail-and-explanation-of-O(n)-solution-why-dpn2*dn-1%2Bdpn-3
813. 最大平均值和的分组https://github.com/hollischuang/algorithm/tree/master/leetcode/813-LargestSumOfAverages
https://leetcode-cn.com/problems/largest-sum-of-averages/https://leetcode-cn.com/problems/largest-sum-of-averages/
https://leetcode.com/articles/largest-sum-of-averages/https://leetcode.com/articles/largest-sum-of-averages/
376. 摆动序列变https://github.com/hollischuang/algorithm/tree/master/leetcode/367-ValidPerfectSquare
https://leetcode-cn.com/problems/wiggle-subsequence/https://leetcode-cn.com/problems/wiggle-subsequence/
https://leetcode.com/articles/wiggle-subsequence/https://leetcode.com/articles/wiggle-subsequence/
801. 使序列递增的最小交换次数https://github.com/hollischuang/algorithm/tree/master/leetcode/801-MinimumSwapsToMakeSequencesIncreasing
https://leetcode-cn.com/problems/minimum-swaps-to-make-sequences-increasing/https://leetcode-cn.com/problems/minimum-swaps-to-make-sequences-increasing/
https://leetcode.com/articles/minimum-swaps-to-make-sequences-increasing/https://leetcode.com/articles/minimum-swaps-to-make-sequences-increasing/
808. 分汤https://github.com/hollischuang/algorithm/tree/master/leetcode/808-SoupServings
https://leetcode-cn.com/problems/soup-servings/https://leetcode-cn.com/problems/soup-servings/
https://leetcode.com/articles/soup-servings/https://leetcode.com/articles/soup-servings/
63. 不同路径 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/063-UniquePathsII
https://leetcode-cn.com/problems/unique-paths-ii/https://leetcode-cn.com/problems/unique-paths-ii/
https://leetcode.com/articles/unique-paths-ii/https://leetcode.com/articles/unique-paths-ii/
213. 打家劫舍 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/213-HouseRobberII
https://leetcode-cn.com/problems/house-robber-ii/https://leetcode-cn.com/problems/house-robber-ii/
https://leetcode.com/problems/house-robber-ii/discuss/59934/Simple-AC-solution-in-Java-in-O(n)-with-explanationhttps://leetcode.com/problems/house-robber-ii/discuss/59934/Simple-AC-solution-in-Java-in-O(n)-with-explanation
368. 最大整除子集https://github.com/hollischuang/algorithm/tree/master/leetcode/368-LargestDivisibleSubset
https://leetcode-cn.com/problems/largest-divisible-subset/https://leetcode-cn.com/problems/largest-divisible-subset/
https://leetcode.com/problems/largest-divisible-subset/discuss/84006/Classic-DP-solution-similar-to-LIS-O(n2)https://leetcode.com/problems/largest-divisible-subset/discuss/84006/Classic-DP-solution-similar-to-LIS-O(n2)
467. 环绕字符串中唯一的子字符串https://github.com/hollischuang/algorithm/tree/master/leetcode/467-UniqueSubstringsInWraparoundString
https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string/https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string/
https://leetcode.com/problems/unique-substrings-in-wraparound-string/discuss/95439/Concise-Java-solution-using-DPhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/discuss/95439/Concise-Java-solution-using-DP
464. 我能赢吗https://github.com/hollischuang/algorithm/tree/master/leetcode/464-CanIWin
https://leetcode-cn.com/problems/can-i-win/https://leetcode-cn.com/problems/can-i-win/
https://leetcode.com/problems/can-i-win/discuss/95277/Java-solution-using-HashMap-with-detailed-explanationhttps://leetcode.com/problems/can-i-win/discuss/95277/Java-solution-using-HashMap-with-detailed-explanation
https://leetcode.com/problems/can-i-win/discuss/95293/Java-easy-strightforward-solution-with-explanationhttps://leetcode.com/problems/can-i-win/discuss/95293/Java-easy-strightforward-solution-with-explanation
935. 骑士拨号器https://github.com/hollischuang/algorithm/tree/master/leetcode/935-KnightDialer
https://leetcode-cn.com/problems/knight-dialer/https://leetcode-cn.com/problems/knight-dialer/
https://leetcode.com/articles/knight-dialer/https://leetcode.com/articles/knight-dialer/
787. K 站中转内最便宜的航班https://github.com/hollischuang/algorithm/tree/master/leetcode/787-CheapestFlightsWithinKStops
https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/
https://leetcode.com/problems/cheapest-flights-within-k-stops/discuss/115541/JavaPython-Priority-Queue-Solutionhttps://leetcode.com/problems/cheapest-flights-within-k-stops/discuss/115541/JavaPython-Priority-Queue-Solution
https://leetcode.com/problems/cheapest-flights-within-k-stops/discuss/128776/5-ms-AC-Java-Solution-based-on-Dijkstra's-Algorithmhttps://leetcode.com/problems/cheapest-flights-within-k-stops/discuss/128776/5-ms-AC-Java-Solution-based-on-Dijkstra's-Algorithm
576. 出界的路径数https://github.com/hollischuang/algorithm/tree/master/leetcode/576-OutOfBoundaryPaths
https://leetcode-cn.com/problems/out-of-boundary-paths/https://leetcode-cn.com/problems/out-of-boundary-paths/
https://leetcode.com/articles/out-of-boundary-paths/https://leetcode.com/articles/out-of-boundary-paths/
374. 猜数字大小https://github.com/hollischuang/algorithm/tree/master/leetcode/374-GuessNumberHigherOrLower
https://leetcode-cn.com/problems/guess-number-higher-or-lower/https://leetcode-cn.com/problems/guess-number-higher-or-lower/
https://leetcode.com/articles/guess-number-higher-or-lower/https://leetcode.com/articles/guess-number-higher-or-lower/
375. 猜数字大小 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/375-GuessNumberHigherOrLowerII
https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/
https://leetcode.com/problems/guess-number-higher-or-lower-ii/discuss/84764/Simple-DP-solution-with-explanation~~https://leetcode.com/problems/guess-number-higher-or-lower-ii/discuss/84764/Simple-DP-solution-with-explanation~~
967. 连续差相同的数字https://github.com/hollischuang/algorithm/tree/master/leetcode/967-NumbersWithSameConsecutiveDifferences
https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences/https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences/
https://leetcode.com/articles/numbers-with-same-consecutive-differences/https://leetcode.com/articles/numbers-with-same-consecutive-differences/
673. 最长递增子序列的个数https://github.com/hollischuang/algorithm/tree/master/leetcode/673-NumberOfLongestIncreasingSubsequence
https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/
https://leetcode.com/articles/number-of-longest-increasing-subsequence/https://leetcode.com/articles/number-of-longest-increasing-subsequence/
131. 分割回文串https://github.com/hollischuang/algorithm/tree/master/leetcode/131-PalindromePartitioning
https://leetcode-cn.com/problems/palindrome-partitioning/https://leetcode-cn.com/problems/palindrome-partitioning/
https://leetcode.com/problems/palindrome-partitioning/discuss/41963/Java%3A-Backtracking-solution.https://leetcode.com/problems/palindrome-partitioning/discuss/41963/Java%3A-Backtracking-solution.
132. 分割回文串IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/132-PalindromePartitioningII
https://leetcode-cn.com/problems/palindrome-partitioning-ii/https://leetcode-cn.com/problems/palindrome-partitioning-ii/
https://leetcode.com/problems/palindrome-partitioning-ii/discuss/42198/My-solution-does-not-need-a-table-for-palindrome-is-it-right-It-uses-only-O(n)-space.https://leetcode.com/problems/palindrome-partitioning-ii/discuss/42198/My-solution-does-not-need-a-table-for-palindrome-is-it-right-It-uses-only-O(n)-space.
5. 最长回文子串https://github.com/hollischuang/algorithm/tree/master/leetcode/005-LongestPalindromicSubstring
https://leetcode-cn.com/problems/longest-palindromic-substring/https://leetcode-cn.com/problems/longest-palindromic-substring/
https://leetcode.com/articles/longest-palindromic-substring/https://leetcode.com/articles/longest-palindromic-substring/
523. 连续的子数组和https://github.com/hollischuang/algorithm/tree/master/leetcode/523-ContinuousSubarraySum
https://leetcode-cn.com/problems/continuous-subarray-sum/https://leetcode-cn.com/problems/continuous-subarray-sum/
https://leetcode.com/problems/continuous-subarray-sum/discuss/99499/Java-O(n)-time-O(k)-spacehttps://leetcode.com/problems/continuous-subarray-sum/discuss/99499/Java-O(n)-time-O(k)-space
837. 新21点https://github.com/hollischuang/algorithm/tree/master/leetcode/837-New21Game
https://leetcode-cn.com/problems/new-21-game/https://leetcode-cn.com/problems/new-21-game/
https://leetcode.com/articles/new-21-game/https://leetcode.com/articles/new-21-game/
898. 子数组按位或操作https://github.com/hollischuang/algorithm/tree/master/leetcode/898-BitwiseORsOfSubarrays
https://leetcode-cn.com/problems/bitwise-ors-of-subarrays/https://leetcode-cn.com/problems/bitwise-ors-of-subarrays/
https://leetcode.com/articles/bitwise-ors-of-subarrays/https://leetcode.com/articles/bitwise-ors-of-subarrays/
91. 解码方法https://github.com/hollischuang/algorithm/tree/master/leetcode/091-DecodeWays
https://leetcode-cn.com/problems/decode-ways/https://leetcode-cn.com/problems/decode-ways/
https://leetcode.com/problems/decode-ways/discuss/30357/DP-Solution-(Java)-for-referencehttps://leetcode.com/problems/decode-ways/discuss/30357/DP-Solution-(Java)-for-reference
https://leetcode.com/problems/decode-ways/discuss/30358/Java-clean-DP-solution-with-explanationhttps://leetcode.com/problems/decode-ways/discuss/30358/Java-clean-DP-solution-with-explanation
312. 戳气球https://github.com/hollischuang/algorithm/tree/master/leetcode/312-BurstBalloons
https://leetcode-cn.com/problems/burst-balloons/https://leetcode-cn.com/problems/burst-balloons/
https://leetcode.com/problems/burst-balloons/discuss/76228/Share-some-analysis-and-explanationshttps://leetcode.com/problems/burst-balloons/discuss/76228/Share-some-analysis-and-explanations
72. 编辑距离https://github.com/hollischuang/algorithm/tree/master/leetcode/072-EditDistance
https://leetcode-cn.com/problems/edit-distance/https://leetcode-cn.com/problems/edit-distance/
https://leetcode.com/problems/edit-distance/discuss/25849/Java-DP-solution-O(nm)https://leetcode.com/problems/edit-distance/discuss/25849/Java-DP-solution-O(nm)
975. 奇偶跳https://github.com/hollischuang/algorithm/tree/master/leetcode/975-OddEvenJump
https://leetcode-cn.com/problems/odd-even-jump/https://leetcode-cn.com/problems/odd-even-jump/
https://leetcode-cn.com/articles/odd-even-jump/https://leetcode-cn.com/articles/odd-even-jump/
115. 不同的子序列https://github.com/hollischuang/algorithm/tree/master/leetcode/115-DistinctSubsequences
https://leetcode-cn.com/problems/distinct-subsequences/https://leetcode-cn.com/problems/distinct-subsequences/
https://leetcode.com/problems/distinct-subsequences/discuss/37327/Easy-to-understand-DP-in-Javahttps://leetcode.com/problems/distinct-subsequences/discuss/37327/Easy-to-understand-DP-in-Java
940. 不同的子序列 IIhttps://github.com/hollischuang/algorithm/tree/master/leetcode/940-DistinctSubsequencesII
https://leetcode-cn.com/problems/distinct-subsequences-ii/https://leetcode-cn.com/problems/distinct-subsequences-ii/
https://leetcode.com/articles/distinct-subsequences-ii/https://leetcode.com/articles/distinct-subsequences-ii/
691. 贴纸拼词https://github.com/hollischuang/algorithm/tree/master/leetcode/691-StickersToSpellWord
https://leetcode-cn.com/problems/stickers-to-spell-word/https://leetcode-cn.com/problems/stickers-to-spell-word/
https://leetcode.com/articles/stickers-to-spell-word/https://leetcode.com/articles/stickers-to-spell-word/
982. 按位与为零的三元组https://github.com/hollischuang/algorithm/tree/master/leetcode/982-TriplesWithBitwiseANDEqualToZero
https://leetcode-cn.com/problems/triples-with-bitwise-and-equal-to-zero/https://leetcode-cn.com/problems/triples-with-bitwise-and-equal-to-zero/
https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/discuss/226721/Java-DP-O(3--216--n)-time-O(216)-spacehttps://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/discuss/226721/Java-DP-O(3-*-216-*-n)-time-O(216)-space
546. 移除盒子https://github.com/hollischuang/algorithm/tree/master/leetcode/546-RemoveBoxes
https://leetcode-cn.com/problems/remove-boxes/https://leetcode-cn.com/problems/remove-boxes/
https://leetcode.com/problems/remove-boxes/discuss/101310/Java-top-down-and-bottom-up-DP-solutionshttps://leetcode.com/problems/remove-boxes/discuss/101310/Java-top-down-and-bottom-up-DP-solutions
85. 最大矩形https://github.com/hollischuang/algorithm/tree/master/leetcode/085-MaximalRectangle
https://leetcode-cn.com/problems/maximal-rectangle/https://leetcode-cn.com/problems/maximal-rectangle/
https://leetcode.com/problems/maximal-rectangle/discuss/29054/Share-my-DP-solutionhttps://leetcode.com/problems/maximal-rectangle/discuss/29054/Share-my-DP-solution
903. DI 序列的有效排列https://github.com/hollischuang/algorithm/tree/master/leetcode/903-ValidPermutationsForDISequence
https://leetcode-cn.com/problems/valid-permutations-for-di-sequence/https://leetcode-cn.com/problems/valid-permutations-for-di-sequence/
https://leetcode.com/articles/valid-permutations-for-di-sequence/https://leetcode.com/articles/valid-permutations-for-di-sequence/
629. K个逆序对数组https://github.com/hollischuang/algorithm/tree/master/leetcode/629-KInversePairsArray
https://leetcode-cn.com/problems/k-inverse-pairs-array/https://leetcode-cn.com/problems/k-inverse-pairs-array/
https://leetcode.com/articles/k-inverse-pairs-array/https://leetcode.com/articles/k-inverse-pairs-array/
956. 最高的广告牌https://github.com/hollischuang/algorithm/tree/master/leetcode/629-KInversePairsArray
https://leetcode-cn.com/problems/tallest-billboard/https://leetcode-cn.com/problems/tallest-billboard/
https://leetcode.com/problems/tallest-billboard/solution/https://leetcode.com/problems/tallest-billboard/solution/
664. 奇怪的打印机https://github.com/hollischuang/algorithm/tree/master/leetcode/629-KInversePairsArray
https://leetcode-cn.com/problems/strange-printer/https://leetcode-cn.com/problems/strange-printer/
https://leetcode.com/problems/strange-printer/solution/https://leetcode.com/problems/strange-printer/solution/
943. 最短超级串https://github.com/hollischuang/algorithm/tree/master/leetcode/943-FindTheShortestSuperstring
https://leetcode-cn.com/problems/find-the-shortest-superstring/https://leetcode-cn.com/problems/find-the-shortest-superstring/
https://leetcode.com/articles/find-the-shortest-superstring/https://leetcode.com/articles/find-the-shortest-superstring/
32. 最长有效括号https://github.com/hollischuang/algorithm/tree/master/leetcode/032-LongestValidParentheses
https://leetcode-cn.com/problems/longest-valid-parentheses/https://leetcode-cn.com/problems/longest-valid-parentheses/
https://leetcode.com/articles/longest-valid-parentheses/https://leetcode.com/articles/longest-valid-parentheses/
403. 青蛙过河https://github.com/hollischuang/algorithm/tree/master/leetcode/403-FrogJump
https://leetcode-cn.com/problems/frog-jump/https://leetcode-cn.com/problems/frog-jump/
https://leetcode.com/problems/frog-jump/discuss/88824/Very-easy-to-understand-JAVA-solution-with-explanationshttps://leetcode.com/problems/frog-jump/discuss/88824/Very-easy-to-understand-JAVA-solution-with-explanations
321. 拼接最大数https://github.com/hollischuang/algorithm/tree/master/leetcode/321-CreateMaximumNumber
https://leetcode.com/problems/create-maximum-number/discuss/77285/Share-my-greedy-solutionhttps://leetcode.com/problems/create-maximum-number/discuss/77285/Share-my-greedy-solution
https://leetcode.com/problems/frog-jump/discuss/88824/Very-easy-to-understand-JAVA-solution-with-explanationshttps://leetcode.com/problems/frog-jump/discuss/88824/Very-easy-to-understand-JAVA-solution-with-explanations
Readme https://github.com/NIGHTFIGHTING/algorithm#readme-ov-file
Please reload this pagehttps://github.com/NIGHTFIGHTING/algorithm
Activityhttps://github.com/NIGHTFIGHTING/algorithm/activity
0 forkshttps://github.com/NIGHTFIGHTING/algorithm/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FNIGHTFIGHTING%2Falgorithm&report=NIGHTFIGHTING+%28user%29
Releaseshttps://github.com/NIGHTFIGHTING/algorithm/releases
Packages 0https://github.com/users/NIGHTFIGHTING/packages?repo_name=algorithm
Please reload this pagehttps://github.com/NIGHTFIGHTING/algorithm
Contributorshttps://github.com/NIGHTFIGHTING/algorithm/graphs/contributors
Please reload this pagehttps://github.com/NIGHTFIGHTING/algorithm
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.