René's URL Explorer Experiment

Title: LintCode/review/Array.md at master · linux2Java/LintCode · GitHub

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

X Title: LintCode/review/Array.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/review/Array.md

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository/blob/name(/path)
route-controller	blob
route-action	show
fetch-nonce	v2:0d54523b-79c7-7ffa-3368-73429a7a027a
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	A3C4:3A11D6:7D834A:ABB42A:6A554D36
html-safe-nonce	f96f329ac88fc1c7ae00a3b96d813b957fdd5d0ac4b492df4138c317a1772438
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBM0M0OjNBMTFENjo3RDgzNEE6QUJCNDJBOjZBNTU0RDM2IiwidmlzaXRvcl9pZCI6IjEyNDk3MzYwMDkxODI0MzI1NjYiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmac	e0693bd15bbcfc342c71b20ba393af7c360d75fcd6df83ffb78176bc67eea42c
hovercard-subject-tag	repository:193480670
github-keyboard-shortcuts	repository,source-code,file-tree,copilot
google-site-verification	Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-url	https://collector.github.com/github/collect
analytics-location	///blob/show
fb:app_id	1401488693436528
apple-itunes-app	app-id=1477376905, app-argument=https://github.com/linux2Java/LintCode/blob/master/review/Array.md
twitter:image	https://opengraph.githubassets.com/c19d9ba84a84cf44cd8ebd37e9684021ae55f1c1cf0d7a6bc6ef58b6f16e8179/linux2Java/LintCode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/c19d9ba84a84cf44cd8ebd37e9684021ae55f1c1cf0d7a6bc6ef58b6f16e8179/linux2Java/LintCode
og:image:alt	Java Solutions to problems on LintCode/LeetCode. Contribute to linux2Java/LintCode development by creating an account on GitHub.
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	cd9eea424140838b22e9eabd53d92b5702617ddd6d76efcd3a37f08d44309ca5
turbo-cache-control	no-cache
go-import	github.com/linux2Java/LintCode git https://github.com/linux2Java/LintCode.git
octolytics-dimension-user_id	12537916
octolytics-dimension-user_login	linux2Java
octolytics-dimension-repository_id	193480670
octolytics-dimension-repository_nwo	linux2Java/LintCode
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	48730410
octolytics-dimension-repository_parent_nwo	terrytong0876/LintCode-1
octolytics-dimension-repository_network_root_id	48730410
octolytics-dimension-repository_network_root_nwo	terrytong0876/LintCode-1
turbo-body-classes	logged-out env-production page-responsive
disable-turbo	false
browser-stats-url	https://api.github.com/_private/browser/stats
browser-errors-url	https://api.github.com/_private/browser/errors
release	3084b9f587e8f1e19803bbe0c77ac77ce3c99c5c
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flinux2Java%2FLintCode%2Fblob%2Fmaster%2Freview%2FArray.md
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub Copilot appDirect agents from issue to merge	https://github.com/features/ai/github-app
MCP RegistryNewIntegrate external tools	https://github.com/mcp
ActionsAutomate any workflow	https://github.com/features/actions
CodespacesInstant dev environments	https://github.com/features/codespaces
IssuesPlan and track work	https://github.com/features/issues
Code ReviewManage code changes	https://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilities	https://github.com/security/advanced-security
Code securitySecure your code as you build	https://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they start	https://github.com/security/advanced-security/secret-protection
Why GitHub	https://github.com/why-github
Documentation	https://docs.github.com
Blog	https://github.blog
Changelog	https://github.blog/changelog
Marketplace	https://github.com/marketplace
View all features	https://github.com/features
Enterprises	https://github.com/enterprise
Small and medium teams	https://github.com/team
Startups	https://github.com/enterprise/startups
Nonprofits	https://github.com/solutions/industry/nonprofits
App Modernization	https://github.com/solutions/use-case/app-modernization
DevSecOps	https://github.com/solutions/use-case/devsecops
DevOps	https://github.com/solutions/use-case/devops
CI/CD	https://github.com/solutions/use-case/ci-cd
View all use cases	https://github.com/solutions/use-case
Healthcare	https://github.com/solutions/industry/healthcare
Financial services	https://github.com/solutions/industry/financial-services
Manufacturing	https://github.com/solutions/industry/manufacturing
Government	https://github.com/solutions/industry/government
View all industries	https://github.com/solutions/industry
View all solutions	https://github.com/solutions
AI	https://github.com/resources/articles?topic=ai
Software Development	https://github.com/resources/articles?topic=software-development
DevOps	https://github.com/resources/articles?topic=devops
Security	https://github.com/resources/articles?topic=security
View all topics	https://github.com/resources/articles
Customer stories	https://github.com/customer-stories
Events & webinars	https://github.com/resources/events
Ebooks & reports	https://github.com/resources/whitepapers
Business insights	https://github.com/solutions/executive-insights
GitHub Skills	https://skills.github.com
Documentation	https://docs.github.com
Customer support	https://support.github.com
Community forum	https://github.com/orgs/community/discussions
Trust center	https://github.com/trust-center
Partners	https://github.com/partners
View all resources	https://github.com/resources
GitHub SponsorsFund open source developers	https://github.com/open-source/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/open-source/accelerator
GitHub Stars	https://stars.github.com
Archive Program	https://archiveprogram.github.com
Topics	https://github.com/topics
Trending	https://github.com/trending
Collections	https://github.com/collections
Enterprise platformAI-powered developer platform	https://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security features	https://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI features	https://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 support	https://github.com/enterprise/premium-support
Pricing	https://github.com/pricing
Search syntax tips	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentation	https://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%2Freview%2FArray.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
Reload	https://github.com/linux2Java/LintCode/blob/master/review/Array.md
Reload	https://github.com/linux2Java/LintCode/blob/master/review/Array.md
Reload	https://github.com/linux2Java/LintCode/blob/master/review/Array.md
linux2Java	https://github.com/linux2Java
LintCode	https://github.com/linux2Java/LintCode
terrytong0876/LintCode-1	https://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
LintCode	https://github.com/linux2Java/LintCode/tree/master
review	https://github.com/linux2Java/LintCode/tree/master/review
History	https://github.com/linux2Java/LintCode/commits/master/review/Array.md
	https://github.com/linux2Java/LintCode/commits/master/review/Array.md
LintCode	https://github.com/linux2Java/LintCode/tree/master
review	https://github.com/linux2Java/LintCode/tree/master/review
Raw	https://github.com/linux2Java/LintCode/raw/refs/heads/master/review/Array.md
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#array-107
Missing Ranges.java	https://github.com/awangdev/LintCode/blob/master/Java/Missing%20Ranges.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic-implementation
Next Permutation.java	https://github.com/awangdev/LintCode/blob/master/Java/Next%20Permutation.java
Partition Array by Odd and Even.java	https://github.com/awangdev/LintCode/blob/master/Java/Partition%20Array%20by%20Odd%20and%20Even.java
Product of Array Exclude Itself.java	https://github.com/awangdev/LintCode/blob/master/Java/Product%20of%20Array%20Exclude%20Itself.java
Recover Rotated Sorted Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Recover%20Rotated%20Sorted%20Array.java
Rotate Image.java	https://github.com/awangdev/LintCode/blob/master/Java/Rotate%20Image.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#找公式规律
Search in Rotated Sorted Array II.java	https://github.com/awangdev/LintCode/blob/master/Java/Search%20in%20Rotated%20Sorted%20Array%20II.java
Subarray Sum II.java	https://github.com/awangdev/LintCode/blob/master/Java/Subarray%20Sum%20II.java
The Smallest Difference.java	https://github.com/awangdev/LintCode/blob/master/Java/The%20Smallest%20Difference.java
Plus One.java	https://github.com/awangdev/LintCode/blob/master/Java/Plus%20One.java
Wiggle Sort.java	https://github.com/awangdev/LintCode/blob/master/Java/Wiggle%20Sort.java
Two Sum II - Input array is sorted.java	https://github.com/awangdev/LintCode/blob/master/Java/Two%20Sum%20II%20-%20Input%20array%20is%20sorted.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointers
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#binary-search-因为已经排好序了啊
2 Sum II.java	https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum%20II.java
Maximum Product Subarray.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Product%20Subarray.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#space-optimization-rolling-array
3 Sum Closest.java	https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum%20Closest.java
Triangle Count.java	https://github.com/awangdev/LintCode/blob/master/Java/Triangle%20Count.java
3Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/3Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-array-for-loop--two-pointer-on2
Unique Paths II.java	https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Paths%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#坐标dp
3Sum Smaller.java	https://github.com/awangdev/LintCode/blob/master/Java/3Sum%20Smaller.java
Array Partition I.java	https://github.com/awangdev/LintCode/blob/master/Java/Array%20Partition%20I.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-basics
1-bit and 2-bit Characters.java	https://github.com/awangdev/LintCode/blob/master/Java/1-bit%20and%202-bit%20Characters.java
Non-decreasing Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Non-decreasing%20Array.java
Max Consecutive Ones.java	https://github.com/awangdev/LintCode/blob/master/Java/Max%20Consecutive%20Ones.java
Find All Numbers Disappeared in an Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20All%20Numbers%20Disappeared%20in%20an%20Array.java
Maximum Average Subarray I.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Average%20Subarray%20I.java
Largest Number At Least Twice of Others.java	https://github.com/awangdev/LintCode/blob/master/Java/Largest%20Number%20At%20Least%20Twice%20of%20Others.java
Toeplitz Matrix.java	https://github.com/awangdev/LintCode/blob/master/Java/Toeplitz%20Matrix.java
Find Peak Element.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20Peak%20Element.java
Majority Element.java	https://github.com/awangdev/LintCode/blob/master/Java/Majority%20Element.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#vote-计数
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashmap-count-occurance
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bit-manipulation
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#related-problems
Construct Binary Tree from Preorder and Inorder Traversal.java	https://github.com/awangdev/LintCode/blob/master/Java/Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs
Minimum Size Subarray Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Size%20Subarray%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointer
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#binary-search
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#double-for-loop
Find Minimum in Rotated Sorted Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20Minimum%20in%20Rotated%20Sorted%20Array.java
Find Minimum in Rotated Sorted Array II.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.java
Word Search.java	https://github.com/awangdev/LintCode/blob/master/Java/Word%20Search.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-backtracking
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#note-other-ways-of-marking-visited
Trapping Rain Water.java	https://github.com/awangdev/LintCode/blob/master/Java/Trapping%20Rain%20Water.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法3
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法4
Largest Rectangle in Histogram.java	https://github.com/awangdev/LintCode/blob/master/Java/Largest%20Rectangle%20in%20Histogram.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#monotonous-stack
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#知识点
Find the Duplicate Number.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20the%20Duplicate%20Number.java
Game of Life.java	https://github.com/awangdev/LintCode/blob/master/Java/Game%20of%20Life.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#follow-up
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#improvement-do-it-in-place
Maximum Average Subarray II.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Average%20Subarray%20II.java
Number of Airplane in the sky.java	https://github.com/awangdev/LintCode/blob/master/Java/Number%20of%20Airplane%20in%20the%20sky.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sweep-line
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#注意
Unique Path.java	https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Path.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#滚动数组
Maximal Rectangle.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximal%20Rectangle.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法1-monotonous-stack
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#方法2-dp
Coins in a Line II.java	https://github.com/awangdev/LintCode/blob/master/Java/Coins%20in%20a%20Line%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-game-theory-自考过程比较长
http://www.cnblogs.com/grandyang/p/5864323.html	http://www.cnblogs.com/grandyang/p/5864323.html
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#推算表达式
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#简化表达式
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#initialization
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#时间空间
Coins in a Line III.java	https://github.com/awangdev/LintCode/blob/master/Java/Coins%20in%20a%20Line%20III.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#memoization--search
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#博弈--区间dp-interval-dp
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#公式推导
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#注意-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#区间型动态规划
Contains Duplicate.java	https://github.com/awangdev/LintCode/blob/master/Java/Contains%20Duplicate.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashset
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-binary-search
Contains Duplicate II.java	https://github.com/awangdev/LintCode/blob/master/Java/Contains%20Duplicate%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashset-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashtablevalue-list-of-duplicates
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#这两种做法的区别很有艺术感觉
Jump Game.java	https://github.com/awangdev/LintCode/blob/master/Java/Jump%20Game.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#greedy---start-from-index--0
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#greedy---start-from-index--n---1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-2
Longest Continuous Increasing Subsequence.java	https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Continuous%20Increasing%20Subsequence.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#coordinate-dp
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic-1
Minimum Path Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Path%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-3
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#rolling-array
Best Time to Buy and Sell Stock III.java	https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp加状态
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#partial-profit
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#rolling-array-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#找峰头
First Missing Positive.java	https://github.com/awangdev/LintCode/blob/master/Java/First%20Missing%20Positive.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#array分析-index-技巧
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#edge-case
Longest Increasing Continuous subsequence.java	https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Continuous%20subsequence.java
https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/	https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/
Longest Increasing Continuous subsequence II.java	https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Continuous%20subsequence%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#coordinate-dp-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#memoization
Maximum Subarray.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Subarray.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sequence-dp
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#divide-and-conquer-dfs
Maximum Subarray II.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Subarray%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-4
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#presum-minpresum
Median.java	https://github.com/awangdev/LintCode/blob/master/Java/Median.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#quick-select
Missing Number.java	https://github.com/awangdev/LintCode/blob/master/Java/Missing%20Number.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#swap
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bit-manipulation-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hastset
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sorting
Remove Duplicates from Sorted Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Duplicates%20from%20Sorted%20Array.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointers-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#思考模式
Remove Duplicates from Sorted Array II.java	https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Duplicates%20from%20Sorted%20Array%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointers-2
Combination Sum IV.java	https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum%20IV.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#backpack-dp
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-backtracking-1
Longest Consecutive Sequence.java	https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Consecutive%20Sequence.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashset-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#union-find
https://www.jianshu.com/p/e6b955ca208f	https://www.jianshu.com/p/e6b955ca208f
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#特点
Partition Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Partition%20Array.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointer-1
Container With Most Water.java	https://github.com/awangdev/LintCode/blob/master/Java/Container%20With%20Most%20Water.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointers-3
Majority Element II.java	https://github.com/awangdev/LintCode/blob/master/Java/Majority%20Element%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort--count
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-counters
Search a 2D Matrix.java	https://github.com/awangdev/LintCode/blob/master/Java/Search%20a%202D%20Matrix.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#2d-matrix-转1d-array
Search for a Range.java	https://github.com/awangdev/LintCode/blob/master/Java/Search%20for%20a%20Range.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#binary-search-1
Merge Sorted Array II.java	https://github.com/awangdev/LintCode/blob/master/Java/Merge%20Sorted%20Array%20II.java
Summary Ranges.java	https://github.com/awangdev/LintCode/blob/master/Java/Summary%20Ranges.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic-implementation-1
Spiral Matrix.java	https://github.com/awangdev/LintCode/blob/master/Java/Spiral%20Matrix.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dx-dy
Insert Interval.java	https://github.com/awangdev/LintCode/blob/master/Java/Insert%20Interval.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sweep-line-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic-implementation-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#另外
Two Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Two%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashmapvalue-index
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-array-two-pointer
K Empty Slots.java	https://github.com/awangdev/LintCode/blob/master/Java/K%20Empty%20Slots.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bst
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#track-slots-of-days
http://www.cnblogs.com/grandyang/p/8415880.html	http://www.cnblogs.com/grandyang/p/8415880.html
Max Sum of Rectangle No Larger Than K.java	https://github.com/awangdev/LintCode/blob/master/Java/Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bst-array-presum
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#思想
Construct Binary Tree from Inorder and Postorder Traversal.java	https://github.com/awangdev/LintCode/blob/master/Java/Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-divide-and-conquer
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#improvement
Max Area of Island.java	https://github.com/awangdev/LintCode/blob/master/Java/Max%20Area%20of%20Island.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-1
Max Points on a Line.java	https://github.com/awangdev/LintCode/blob/master/Java/Max%20Points%20on%20a%20Line.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#observation
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#trick-prune-parallel-dots-using-greatest-common-divider
Subarray Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Subarray%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hash-table
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#previous-notes-same-presum--map-solution
Submatrix Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Submatrix%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#presum的思想
Jump Game II.java	https://github.com/awangdev/LintCode/blob/master/Java/Jump%20Game%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#greedy
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#previous-notes-greedy
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#even-simpler-greedy
http://www.cnblogs.com/lichen782/p/leetcode_Jump_Game_II.html	http://www.cnblogs.com/lichen782/p/leetcode_Jump_Game_II.html
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-5
Triangles.java	https://github.com/awangdev/LintCode/blob/master/Java/Triangles.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs--memoization
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-6
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp--on-space
Merge Intervals.java	https://github.com/awangdev/LintCode/blob/master/Java/Merge%20Intervals.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sweep-line-with-priority-queue
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-interval
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sort-intervals-and-append-end-logically
Sort Colors.java	https://github.com/awangdev/LintCode/blob/master/Java/Sort%20Colors.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#partition-array-the-base-of-quick-sort
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#one-pass
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#counting-sort
Task Scheduler.java	https://github.com/awangdev/LintCode/blob/master/Java/Task%20Scheduler.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#array-count-frequency-enumerate
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#priorityqueue
Anagrams.java	https://github.com/awangdev/LintCode/blob/master/Java/Anagrams.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashmap
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashmap--sort
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#previous-notes
http://www.jiuzhang.com/solutions/anagrams/	http://www.jiuzhang.com/solutions/anagrams/
Unique Characters.java	https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Characters.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hashset-3
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#char
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#no-additional-data-structure
Subsets.java	https://github.com/awangdev/LintCode/blob/master/Java/Subsets.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bit-manipulation-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#iterative-bfs
Subsets II.java	https://github.com/awangdev/LintCode/blob/master/Java/Subsets%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-3
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bfs
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#previous-notes-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#注意-2
Combination Sum.java	https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-backtracking-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#time-complexity-for-combination-reuse-candidate
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#combination-dfs-思想
Combination Sum II.java	https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-backtracking-3
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#time-complexity
Combination Sum III.java	https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum%20III.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dfs-backtracking-4
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#time-complexity-1
Product of Array Except Self.java	https://github.com/awangdev/LintCode/blob/master/Java/Product%20of%20Array%20Except%20Self.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#array-preproduct
Subarray Sum Equals K.java	https://github.com/awangdev/LintCode/blob/master/Java/Subarray%20Sum%20Equals%20K.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hash-table--presum
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#detailed-explanation
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#presum-on2
Maximize Distance to Closest Person.java	https://github.com/awangdev/LintCode/blob/master/Java/Maximize%20Distance%20to%20Closest%20Person.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basic-implementation-track-startend
Best Time to Buy and Sell Stock.java	https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#理解意思是关键
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-7
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#rolling-array-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#brutle-failed
Best Time to Buy and Sell Stock II.java	https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#几种其他不同的思路
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#greedy-1
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#找涨幅最大的区间买卖
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-sequence-dp--status
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#rolling-array-3
Best Time to Buy and Sell Stock with Transaction Fee.java	https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sequence-dp-1
Find the Celebrity.java	https://github.com/awangdev/LintCode/blob/master/Java/Find%20the%20Celebrity.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#understand-the-property
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#思考逻辑
Friends Of Appropriate Ages.java	https://github.com/awangdev/LintCode/blob/master/Java/Friends%20Of%20Appropriate%20Ages.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#array-math
Insert Delete GetRandom O(1).java	https://github.com/awangdev/LintCode/blob/master/Java/Insert%20Delete%20GetRandom%20O(1).java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#hash-table-1
Search in Rotated Sorted Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Search%20in%20Rotated%20Sorted%20Array.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#binary-search-2
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#binary-search-break-point-然后继续binary-search-target
Minimum Subarray.java	https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Subarray.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#dp-8
My Calendar I.java	https://github.com/awangdev/LintCode/blob/master/Java/My%20Calendar%20I.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#simply-on-check-on-array
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#treemap
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#about-treemap
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#sweep-line-2
Merge Sorted Array.java	https://github.com/awangdev/LintCode/blob/master/Java/Merge%20Sorted%20Array.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#basics
Word Ladder II.java	https://github.com/awangdev/LintCode/blob/master/Java/Word%20Ladder%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bfs--reverse-search
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bfs-prep-step
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#search-using-dfs
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#bi-directional-bfs-search-using-bfs
Move Zeroes.java	https://github.com/awangdev/LintCode/blob/master/Java/Move%20Zeroes.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#two-pointers-4
Median of Two Sorted Arrays.java	https://github.com/awangdev/LintCode/blob/master/Java/Median%20of%20Two%20Sorted%20Arrays.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#divide-and-conquer-recursive
The Spiral Matrix II.java	https://github.com/awangdev/LintCode/blob/master/Java/The%20Spiral%20Matrix%20II.java
	https://github.com/linux2Java/LintCode/blob/master/review/Array.md#move-forward-till-end
	https://github.com
Terms	https://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacy	https://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Security	https://github.com/security
Status	https://www.githubstatus.com/
Community	https://github.community/
Docs	https://docs.github.com/
Contact	https://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.