Skip to content

huihan/LeetCode-OneTake

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

96 Commits

01_0_Binary Tree Inorder Traversal.java

01_0_Binary Tree Inorder Traversal.java

 
 

01_0_Maximum Depth of Binary Tree.java

01_0_Maximum Depth of Binary Tree.java

 
 

02_0_Balanced Binary Tree.java

02_0_Balanced Binary Tree.java

 
 

02_0_Best Time to Buy and Sell Stock II.java

02_0_Best Time to Buy and Sell Stock II.java

 
 

02_0_Best Time to Buy and Sell Stock.java

02_0_Best Time to Buy and Sell Stock.java

 
 

02_0_Binary Tree Level Order Traversal.java

02_0_Binary Tree Level Order Traversal.java

 
 

02_0_Climbing Stairs.java

02_0_Climbing Stairs.java

 
 

02_0_Merge Sorted Array.java

02_0_Merge Sorted Array.java

 
 

02_0_Validate Binary Search Tree.java

02_0_Validate Binary Search Tree.java

 
 

02_1_Combinations.java

02_1_Combinations.java

 
 

02_1_Minimum Depth of Binary Tree.java

02_1_Minimum Depth of Binary Tree.java

 
 

03_0_Conver Sorted Array to Binary Search Tree.java

03_0_Conver Sorted Array to Binary Search Tree.java

 
 

03_0_Minimum Path Sum.java

03_0_Minimum Path Sum.java

 
 

03_0_Partition List.java

03_0_Partition List.java

 
 

03_0_Path Sum.java

03_0_Path Sum.java

 
 

03_0_Plus One.java

03_0_Plus One.java

 
 

03_0_Same Tree.java

03_0_Same Tree.java

 
 

03_0_Triangle.java

03_0_Triangle.java

 
 

03_1_Remove Duplicates from Sorted List.java

03_1_Remove Duplicates from Sorted List.java

 
 

03_2_Pascal's Triangle.java

03_2_Pascal's Triangle.java

 
 

04_0_Balanced Binary Tree.java

04_0_Balanced Binary Tree.java

 
 

04_0_Subsets.java

04_0_Subsets.java

 
 

04_2_Pascal's Triangle II

04_2_Pascal's Triangle II

 
 

05_0_Flatten Binary Tree to Linked List.java

05_0_Flatten Binary Tree to Linked List.java

 
 

05_0_Sqrt(x).java

05_0_Sqrt(x).java

 
 

05_0_Unique Binary Search Trees.java

05_0_Unique Binary Search Trees.java

 
 

05_1_Longest Consecutive Sequence

05_1_Longest Consecutive Sequence

 
 

05_1_Sum Root to Leaf Numbers

05_1_Sum Root to Leaf Numbers

 
 

05_2_Valid Palindrome

05_2_Valid Palindrome

 
 

05_3_Surrounded Regions.java

05_3_Surrounded Regions.java

 
 

06_0_Decode Ways.java

06_0_Decode Ways.java

 
 

06_1_Construct Binary Tree from Inorder and Postorder Traversal

06_1_Construct Binary Tree from Inorder and Postorder Traversal

 
 

06_1_Construct Binary Tree from Preorder and Inorder Traversal.java

06_1_Construct Binary Tree from Preorder and Inorder Traversal.java

 
 

06_2_Binary Tree Maximum Path Sum

06_2_Binary Tree Maximum Path Sum

 
 

07_1_Word Search.java

07_1_Word Search.java

 
 

07_2_Path Sum II.java

07_2_Path Sum II.java

 
 

07_7_Binary Tree Zigzag Level Order Traversal.java

07_7_Binary Tree Zigzag Level Order Traversal.java

 
 

08_0_Add Binary.java

08_0_Add Binary.java

 
 

08_0_Binary Tree Level Order Traversal II.java

08_0_Binary Tree Level Order Traversal II.java

 
 

08_0_Symmetric Tree.java

08_0_Symmetric Tree.java

 
 

08_1_$B$Recover Binary Search Tree.java

08_1_$B$Recover Binary Search Tree.java

 
 

08_1_Unique Binary Search Trees II.java

08_1_Unique Binary Search Trees II.java

 
 

09_1_Remove Duplicates from Sorted Array II.java

09_1_Remove Duplicates from Sorted Array II.java

 
 

09_1_Sort Colors.java

09_1_Sort Colors.java

 
 

09_2_Set Matrix Zeroes.java

09_2_Set Matrix Zeroes.java

 
 

10_0_Merge Two Sorted Lists.java

10_0_Merge Two Sorted Lists.java

 
 

10_0_Populating Next Right Pointers in Each Node

10_0_Populating Next Right Pointers in Each Node

 
 

10_1_Edit Distance.java

10_1_Edit Distance.java

 
 

10_1_Remove Duplicates from Sorted List II.java

10_1_Remove Duplicates from Sorted List II.java

 
 

10_2_Reverse Linked List II

10_2_Reverse Linked List II

 
 

10_3_Two Sum.java

10_3_Two Sum.java

 
 

10_Un_Median of Two Sorted Arrays.java

10_Un_Median of Two Sorted Arrays.java

 
 

11_2_Gray Code.java

11_2_Gray Code.java

 
 

12_2_Subsets II

12_2_Subsets II

 
 

13_0_Search a 2D Matrix.java

13_0_Search a 2D Matrix.java

 
 

13_2_Interleaving String

13_2_Interleaving String

 
 

14_0_Scramble String.java

14_0_Scramble String.java

 
 

15_0_Word Ladder

15_0_Word Ladder

 
 

16_0_Restore IP Addresses.java

16_0_Restore IP Addresses.java

 
 

16_3_Palindrome Partitioning

16_3_Palindrome Partitioning

 
 

17_2_Word Ladder II

17_2_Word Ladder II

 
 

17_4_Longest Palindromic Substring.java

17_4_Longest Palindromic Substring.java

 
 

18!_0_Convert Sorted List to Binary Search Tree.java

18!_0_Convert Sorted List to Binary Search Tree.java

 
 

18!_1_$new Way$Convert Sorted List to Binary Search Tree.java

18!_1_$new Way$Convert Sorted List to Binary Search Tree.java

 
 

18_0_Maximal Rectangle.java

18_0_Maximal Rectangle.java

 
 

18_0_^Largest Rectangle in Histogram.java

18_0_^Largest Rectangle in Histogram.java

 
 

18_1_!Maximal Rectangle.java

18_1_!Maximal Rectangle.java

 
 

18_1_Distinct Subsequences

18_1_Distinct Subsequences

 
 

18_1_Minimum Window Substring.java

18_1_Minimum Window Substring.java

 
 

18_1_Populating Next Right Pointers in Each Node II

18_1_Populating Next Right Pointers in Each Node II

 
 

18_2_Best Time to Buy and Sell Stock III

18_2_Best Time to Buy and Sell Stock III

 
 

18_2_Palindrome Partitioning II

18_2_Palindrome Partitioning II

 
 

18_2_Search in Rotated Sorted Array II.java

18_2_Search in Rotated Sorted Array II.java

 
 

18_4_Minimum Window Substring.java

18_4_Minimum Window Substring.java

 
 

README.md

README.md

 
 

Repository files navigation

LeetCode One take

These files are writen to practice bug-free coding. And usually the answer is better than the older one.

18_1_problem.name.java means hard degree_bug counts_name.java

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages