René's URL Explorer Experiment


Title: LintCode/KnowledgeHash.md at master · linux2Java/LintCode · GitHub

Open Graph Title: LintCode/KnowledgeHash.md at master · linux2Java/LintCode

X Title: LintCode/KnowledgeHash.md at master · linux2Java/LintCode

Description: Java Solutions to problems on LintCode/LeetCode. Contribute to linux2Java/LintCode development by creating an account on GitHub.

Open Graph Description: Java Solutions to problems on LintCode/LeetCode. Contribute to linux2Java/LintCode development by creating an account on GitHub.

X Description: Java Solutions to problems on LintCode/LeetCode. Contribute to linux2Java/LintCode development by creating an account on GitHub.

Opengraph URL: https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository/blob/*name(/*path)
route-controllerblob
route-actionshow
fetch-noncev2:85210003-0b61-ec51-6477-e2842cd4646b
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idE798:23950F:1091E2C:16E776C:6A53BC37
html-safe-nonce444a9968161e44bf93c242be468980dc4060f3750d8b06ad0895e74453af1666
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJFNzk4OjIzOTUwRjoxMDkxRTJDOjE2RTc3NkM6NkE1M0JDMzciLCJ2aXNpdG9yX2lkIjoiNDQ0MTkxMTY2MjQyMTk4MjI2MyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac042d91599ef754d0f1e20c9773a7727b098e0656a92f63afa1afd0b2a52acd4b
hovercard-subject-tagrepository:193480670
github-keyboard-shortcutsrepository,source-code,file-tree,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location///blob/show
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md
twitter:imagehttps://opengraph.githubassets.com/c19d9ba84a84cf44cd8ebd37e9684021ae55f1c1cf0d7a6bc6ef58b6f16e8179/linux2Java/LintCode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/c19d9ba84a84cf44cd8ebd37e9684021ae55f1c1cf0d7a6bc6ef58b6f16e8179/linux2Java/LintCode
og:image:altJava Solutions to problems on LintCode/LeetCode. Contribute to linux2Java/LintCode development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noneb9a586c06a05a7a86fc7e3f4dbd03e42f6869085879aa184aa6369456dbd50fb
turbo-cache-controlno-cache
go-importgithub.com/linux2Java/LintCode git https://github.com/linux2Java/LintCode.git
octolytics-dimension-user_id12537916
octolytics-dimension-user_loginlinux2Java
octolytics-dimension-repository_id193480670
octolytics-dimension-repository_nwolinux2Java/LintCode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id48730410
octolytics-dimension-repository_parent_nwoterrytong0876/LintCode-1
octolytics-dimension-repository_network_root_id48730410
octolytics-dimension-repository_network_root_nwoterrytong0876/LintCode-1
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
release07a982c1d40157c619b364352b704c3ce66bb332
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flinux2Java%2FLintCode%2Fblob%2Fmaster%2FKnowledgeHash.md
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%2Flinux2Java%2FLintCode%2Fblob%2Fmaster%2FKnowledgeHash.md
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%2Fblob%2Fshow&source=header-repo&source_repo=linux2Java%2FLintCode
Reloadhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md
Reloadhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md
Reloadhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md
linux2Java https://github.com/linux2Java
LintCodehttps://github.com/linux2Java/LintCode
terrytong0876/LintCode-1https://github.com/terrytong0876/LintCode-1
Notifications https://github.com/login?return_to=%2Flinux2Java%2FLintCode
Fork 0 https://github.com/login?return_to=%2Flinux2Java%2FLintCode
Star 0 https://github.com/login?return_to=%2Flinux2Java%2FLintCode
Code https://github.com/linux2Java/LintCode
Pull requests 0 https://github.com/linux2Java/LintCode/pulls
Actions https://github.com/linux2Java/LintCode/actions
Projects https://github.com/linux2Java/LintCode/projects
Security and quality 0 https://github.com/linux2Java/LintCode/security
Insights https://github.com/linux2Java/LintCode/pulse
Code https://github.com/linux2Java/LintCode
Pull requests https://github.com/linux2Java/LintCode/pulls
Actions https://github.com/linux2Java/LintCode/actions
Projects https://github.com/linux2Java/LintCode/projects
Security and quality https://github.com/linux2Java/LintCode/security
Insights https://github.com/linux2Java/LintCode/pulse
https://github.com/linux2Java/LintCode
LintCodehttps://github.com/linux2Java/LintCode/tree/master
Historyhttps://github.com/linux2Java/LintCode/commits/master/KnowledgeHash.md
https://github.com/linux2Java/LintCode/commits/master/KnowledgeHash.md
LintCodehttps://github.com/linux2Java/LintCode/tree/master
Rawhttps://github.com/linux2Java/LintCode/raw/refs/heads/master/KnowledgeHash.md
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#table-of-contents
Table of Contentshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#table-of-contents
Arrayhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#array
Honorable Problemshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#honorable-problems
Stringhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#string
Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions
StringBufferhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#stringbuffer
其他https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%85%B6%E4%BB%96
Hash Tablehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hash-table
HashTablehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashtable
HashSethttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashset
HashMaphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashmap
Heaphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap
Inserthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#insert
Extract Minimum Elementhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#extract-minimum-element
如何想到用 Min/Max Heaphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%A6%82%E4%BD%95%E6%83%B3%E5%88%B0%E7%94%A8-minmax-heap
Examplehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example
Stackhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#stack
Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-1
基本用法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E7%94%A8%E6%B3%95
Monotonous Stackhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#monotonous-stack
Examplehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-1
Queuehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#queue
Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-2
Linked Listhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#linked-list
考法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%80%83%E6%B3%95
Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#tree
Binary Search Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-search-tree
TreeSethttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#treeset
Traversalhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#traversal
Binary Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-tree
Type of Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#type-of-tree
Balanced bianry treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#balanced-bianry-tree
Complete binary treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#complete-binary-tree
Full Binary Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#full-binary-tree
Perfect Binary Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#perfect-binary-tree
Binary Tree Traversalhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-tree-traversal
Inorder Traversalhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#inorder-traversal
Expression Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#expression-tree
Examplehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-2
Build Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#build-tree
Triehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#trie
用法/考点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%94%A8%E6%B3%95%E8%80%83%E7%82%B9
Compare with HashMaphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#compare-with-hashmap
Code Model/ Sample Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#code-model-sample-functions
Binary Indexed Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-indexed-tree
Segment Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#segment-tree
基本知识https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E7%9F%A5%E8%AF%86
functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-3
用法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%94%A8%E6%B3%95
Red Black Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#red-black-tree
基本知识https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E7%9F%A5%E8%AF%86-1
特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E7%82%B9
引申特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%BC%95%E7%94%B3%E7%89%B9%E7%82%B9
用法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%94%A8%E6%B3%95-1
B-Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#b-tree
基本知识https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E7%9F%A5%E8%AF%86-2
AVL Treehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#avl-tree
基本知识https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E7%9F%A5%E8%AF%86-3
更多细节特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%9B%B4%E5%A4%9A%E7%BB%86%E8%8A%82%E7%89%B9%E7%82%B9
用途https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%94%A8%E9%80%94
优点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E4%BC%98%E7%82%B9
Graphhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#graph
Popular algorithmshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#popular-algorithms
Adjacency Listhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#adjacency-list
Examplehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-3
构建Graphhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%9E%84%E5%BB%BAgraph
Adjacency Matriceshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#adjacency-matrices
Graph Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#graph-search
DFShttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs
BFShttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bfs
Bidirectional Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bidirectional-search
Dequehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#deque
Union Findhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#union-find
UnionFind基础操作https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#unionfind%E5%9F%BA%E7%A1%80%E6%93%8D%E4%BD%9C
UnionFind follow uphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#unionfind-follow-up
Topological Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort
建立Graph InDegreehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%BB%BA%E7%AB%8Bgraph--indegree
Topological Sort - BFShttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort---bfs
Topological Sort - DFShttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort---dfs
Two Pointershttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#two-pointers
Binary Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-search
Templatehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#template
中二思想https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E4%B8%AD%E4%BA%8C%E6%80%9D%E6%83%B3
Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sort
常用https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%B8%B8%E7%94%A8
Merge Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#merge-sort
Heap Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap-sort
Quick Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#quick-sort
Quick Selecthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#quick-select
Bucket Sorthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bucket-sort
Comparator for Arrays, Collectionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#comparator-for-arrays-collections
DPhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dp
判断https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%88%A4%E6%96%AD
四个步骤:https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9B%9B%E4%B8%AA%E6%AD%A5%E9%AA%A4
确定状态https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%A1%AE%E5%AE%9A%E7%8A%B6%E6%80%81
转移方程https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%BD%AC%E7%A7%BB%E6%96%B9%E7%A8%8B
初始条件/边界情况https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%88%9D%E5%A7%8B%E6%9D%A1%E4%BB%B6%E8%BE%B9%E7%95%8C%E6%83%85%E5%86%B5
计算顺序https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%AE%A1%E7%AE%97%E9%A1%BA%E5%BA%8F
Techniquehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#technique
基本原理https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9F%BA%E6%9C%AC%E5%8E%9F%E7%90%86
分类https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%88%86%E7%B1%BB
网格坐标https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%BD%91%E6%A0%BC%E5%9D%90%E6%A0%87
特殊https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E6%AE%8A
序列https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%BA%8F%E5%88%97
特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E7%82%B9-1
性质https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%80%A7%E8%B4%A8
特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E7%82%B9-2
关键点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%85%B3%E9%94%AE%E7%82%B9
序列加状态https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%BA%8F%E5%88%97%E5%8A%A0%E7%8A%B6%E6%80%81
划分https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%88%92%E5%88%86
性质https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%80%A7%E8%B4%A8-1
经验https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%BB%8F%E9%AA%8C
解决方法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%A7%A3%E5%86%B3%E6%96%B9%E6%B3%95
博弈类https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%8D%9A%E5%BC%88%E7%B1%BB
背包类https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%83%8C%E5%8C%85%E7%B1%BB
多种问法https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%A4%9A%E7%A7%8D%E9%97%AE%E6%B3%95
方法策略https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%96%B9%E6%B3%95%E7%AD%96%E7%95%A5
放入的物品没有顺序https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%94%BE%E5%85%A5%E7%9A%84%E7%89%A9%E5%93%81%E6%B2%A1%E6%9C%89%E9%A1%BA%E5%BA%8F
区间类(Interval DP)https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%8C%BA%E9%97%B4%E7%B1%BBinterval-dp
特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E7%82%B9-3
三把斧https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E4%B8%89%E6%8A%8A%E6%96%A7
难点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E9%9A%BE%E7%82%B9
Bitwise Operation DPhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bitwise-operation-dp
优化https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E4%BC%98%E5%8C%96
Minimax/MaxiMinhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#minimaxmaximin
Optimization problemshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#optimization-problems
Double Sequencehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#double-sequence
存状态https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%AD%98%E7%8A%B6%E6%80%81
记忆化搜索 Memoization DPhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E8%AE%B0%E5%BF%86%E5%8C%96%E6%90%9C%E7%B4%A2-memoization-dp
什么时候用记忆化搜索https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E4%BB%80%E4%B9%88%E6%97%B6%E5%80%99%E7%94%A8%E8%AE%B0%E5%BF%86%E5%8C%96%E6%90%9C%E7%B4%A2
特点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E7%82%B9-4
缺点https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%BC%BA%E7%82%B9
时间空间复杂度的节省https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%97%B6%E9%97%B4%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E7%9A%84%E8%8A%82%E7%9C%81
Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#search
Breadth-first Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#breadth-first-search
Depth-first Searchhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#depth-first-search
for loop dfs vs. pick&&skip dfshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#for-loop-dfs-vs-pickskip-dfs
void dfshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#void-dfs
object dfshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#object-dfs
Regular Premitiveshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#regular-premitives
Customized Objecthttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#customized-object
Tree DFShttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#tree-dfs
Combinatoricshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#combinatorics
DFS 思想https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs-%E6%80%9D%E6%83%B3
DFS 注意https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs-%E6%B3%A8%E6%84%8F
Permutationhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#permutation
原理https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%8E%9F%E7%90%86
Backtracking DFS (Recursive)https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#backtracking-dfs-recursive
插入法 (iterative)https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E6%8F%92%E5%85%A5%E6%B3%95-iterative
Sweep Linehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sweep-line
Backtrackinghttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#backtracking
Greedyhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#greedy
When to usehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#when-to-use
Exampleshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#examples
Reservoir Samplinghttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#reservoir-sampling
Geometryhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#geometry
Approachhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#approach
遇到Arrayhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E9%81%87%E5%88%B0array
遇到需要排序https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E9%81%87%E5%88%B0%E9%9C%80%E8%A6%81%E6%8E%92%E5%BA%8F
Divide and Conquerhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#divide-and-conquer
Recursionhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#recursion
特征https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E7%89%B9%E5%BE%81
Other minor problem setshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#other-minor-problem-sets
回文串 Palindromehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#%E5%9B%9E%E6%96%87%E4%B8%B2-palindrome
Windows Problemhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#windows-problem
Collections Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#collections-functions
methodshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#methods
ArrayListhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#arraylist
CS Basicshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#cs-basics
BigO Specialshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bigo-specials
Time Complexity of graph/dfs blockhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#time-complexity-of-graphdfs-block
Sum, PrefixSumhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sum-prefixsum
Mathhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#math
Math Functionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#math-functions
Numbershttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#numbers
Probability theoryhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#probability-theory
Combinatoricshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#combinatorics-1
subset time&&spacehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#subset-timespace
Brainteaserhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#brainteaser
Operating systemhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#operating-system
Threadshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#threads
Two approacheshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#two-approaches
Bit Manipulationhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bit-manipulation
Memoryhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#memory
Java Garbage Collectionshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#java-garbage-collections
Heaphttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap-1
Garbage Collection Rootshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#garbage-collection-roots
Examplehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-4
Marking and Sweeping Carbagehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#marking-and-sweeping-carbage
Pain Pointhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#pain-point
NP-Complete problemshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#np-complete-problems
wikihttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#wiki
Knapsackhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#knapsack
Travelling salesmanhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#travelling-salesman
Basicshttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#basics
Edge casehttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#edge-case
Advancedhttps://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#advanced
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#array
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#honorable-problems
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#string
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#stringbuffer
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#其他
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hash-table
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashtable
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashset
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#hashmap
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#insert
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#extract-minimum-element
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#如何想到用-minmax-heap
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#stack
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本用法
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#monotonous-stack
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#queue
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-2
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#linked-list
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#考法
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-search-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#treeset
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#traversal
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#type-of-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#balanced-bianry-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#complete-binary-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#full-binary-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#perfect-binary-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-tree-traversal
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#inorder-traversal
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#expression-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-2
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#build-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#trie
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#用法考点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#compare-with-hashmap
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#code-model-sample-functions
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-indexed-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#segment-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本知识
https://en.wikipedia.org/wiki/Segment_treehttps://en.wikipedia.org/wiki/Segment_tree
https://en.wikipedia.org/wiki/Interval_treehttps://en.wikipedia.org/wiki/Interval_tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#functions-3
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#用法
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#red-black-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本知识-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#引申特点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#用法-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#b-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本知识-2
https://en.wikipedia.org/wiki/B-treehttps://en.wikipedia.org/wiki/B-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#avl-tree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本知识-3
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#更多细节特点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#用途
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#优点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#graph
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#popular-algorithms
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#adjacency-list
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-3
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#构建graph
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#adjacency-matrices
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#graph-search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bidirectional-search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#deque
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#union-find
https://en.wikipedia.org/wiki/Proof_of_O(log*n)_time_complexity_of_union%E2%80%93findhttps://en.wikipedia.org/wiki/Proof_of_O(log*n)_time_complexity_of_union%E2%80%93find
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#unionfind基础操作
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#unionfind-follow-up
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#建立graph--indegree
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort---bfs
https://www.youtube.com/watch?v=_LuIvEi_kZkhttps://www.youtube.com/watch?v=_LuIvEi_kZk
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#topological-sort---dfs
https://youtu.be/AfSk24UTFS8?t=42mhttps://youtu.be/AfSk24UTFS8?t=42m
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#two-pointers
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#binary-search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#template
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#中二思想
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#常用
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#merge-sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap-sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#quick-sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#quick-select
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bucket-sort
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#comparator-for-arrays-collections
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dp
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#判断
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#四个步骤
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#确定状态
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#转移方程
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#初始条件边界情况
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#计算顺序
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#technique
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#基本原理
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#分类
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#网格坐标-coordinate
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特殊
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#序列-sequence
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特点-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#性质
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特点-2
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#关键点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#序列加状态
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#划分partition
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#性质-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#经验
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#解决方法
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#博弈类-game-theory
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#背包类-backpack
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#多种问法
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#方法策略
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#放入的物品没有顺序
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#区间类interval-dp
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特点-3
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#三把斧
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#难点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bitwise-operation-dp
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#优化
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#minimaxmaximin
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#optimization-problems
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#double-sequence
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#存状态
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#记忆化搜索-memoization-dp
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#什么时候用记忆化搜索
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特点-4
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#缺点
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#时间空间复杂度的节省
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#breadth-first-search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#depth-first-search
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#for-loop-dfs-vs-pickskip-dfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#void-dfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#object-dfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#regular-premitives
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#customized-object
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#tree-dfs
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#combinatorics
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs-思想
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#dfs-注意
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#permutation
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#原理
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#backtracking-dfs-recursive
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#插入法-iterative
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sweep-line
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#backtracking
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#greedy
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#when-to-use
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#examples
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#reservoir-sampling
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#geometry
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#approach
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#遇到array
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#遇到需要排序
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#divide-and-conquer
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#recursion
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#特征
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#other-minor-problem-sets
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#回文串-palindrome
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#windows-problem
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#collections-functions
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#methods
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#arraylist
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#cs-basics
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bigo-specials
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#time-complexity-of-graphdfs-block
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#sum-prefixsum
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#math
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#math-functions
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#numbers
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#probability-theory
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#combinatorics-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#subset-timespace
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#brainteaser
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#operating-system
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#threads
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#two-approaches
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#bit-manipulation
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#memory
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#java-garbage-collections
https://www.dynatrace.com/resources/ebooks/javabook/how-garbage-collection-works/https://www.dynatrace.com/resources/ebooks/javabook/how-garbage-collection-works/
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#heap-1
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#garbage-collection-roots
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#example-4
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#marking-and-sweeping-carbage
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#pain-point
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#np-complete-problems
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#wiki
https://en.wikipedia.org/wiki/NP-completenesshttps://en.wikipedia.org/wiki/NP-completeness
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#knapsack
https://en.wikipedia.org/wiki/Knapsack_problemhttps://en.wikipedia.org/wiki/Knapsack_problem
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#travelling-salesman
https://en.wikipedia.org/wiki/Travelling_salesman_problemhttps://en.wikipedia.org/wiki/Travelling_salesman_problem
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#basics
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#edge-case
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#advanced
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#pre-computation
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#knowledge--experience
https://github.com/linux2Java/LintCode/blob/master/KnowledgeHash.md#java-design-pattern
https://www.journaldev.com/1827/java-design-patterns-example-tutorialhttps://www.journaldev.com/1827/java-design-patterns-example-tutorial
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.