Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Java solutions to Leetcode problems.

NotificationsYou must be signed in to change notification settings

JesusCoder/fishercoderLeetcode

Repository files navigation

#TitleSolutionsTimeSpaceDifficultyTagNotes
350Intersection of Two Arrays IISolutionO(m+n)O((m+n)) could be optimizedEasyHashMap, Binary Search
349Intersection of Two ArraysSolutionO(m+n)O(min(m,n))EasyTwo Pointers, Binary Search
283Move ZeroesSolutionO(n)O(1)Easy
278First Bad VersionSolutionO(logn)O(1)EasyBinary Search
209Minimum Size Subarray SumSolutionO(n)O(1)Medium
140Word Break IISolution?O(n^2)HardBacktracking/DFS
139Word BreakSolutionO(n^2)O(n)MediumDP
133Clone GraphSolutionO(n)O(n)MediumHashMap, BFS
117Populating Next Right Pointers in Each Node IISolutionO(n)O(1)HardBFS
116Populating Next Right Pointers in Each NodeSolutionO(n)O(1)MediumBFS
91Decode WaysSolutionO(n)O(n)MediumDP
76Minimum Window SubstringSolutionO(n)O(k)HardTwo Pointers
67Add BinarySolutionO(n)O(1)Easy
56Merge IntervalsSolutionO(n*logn)O(1)Hard
23Merge k Sorted ListsSolutionO(n*logk)O(logk)HardHeap
17Letter Combinations of a Phone NumberSolutionO(n*4^n)O(n)MediumBacktracking
153SumSolutionO(nlogn)O(1)MediumTwo Pointers
10Regular Expression MatchingSolutionO(m*n)O(m*n)HardDP
8String to Integer (atoi)Solution
7Reverse IntegerSolution
2Add Two NumbersSolution
1Two SumSolutionO(n)/O(n^2)O(1)/O(n)EasyHashMap

About

Java solutions to Leetcode problems.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java100.0%
[8]ページ先頭
©2009-2025 Movatter.jp