Skip to content
/ LintCode Public
forked from cherryljr/LintCode

LintCode各题解法分析~ Coding For Fun

0 stars 50 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

narayan8291/LintCode

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

707 Commits

01 Matrix Walking Problem.java

01 Matrix Walking Problem.java

 
 

3 Sum Closest.java

3 Sum Closest.java

 
 

3 Sum.java

3 Sum.java

 
 

4 Sum.java

4 Sum.java

 
 

A+B.java

A+B.java

 
 

AND and OR.java

AND and OR.java

 
 

Add Digits.java

Add Digits.java

 
 

Add and Search Word.java

Add and Search Word.java

 
 

Amicable Pair.java

Amicable Pair.java

 
 

Anagrams.java

Anagrams.java

 
 

Assign Cookies.java

Assign Cookies.java

 
 

Backpack II.java

Backpack II.java

 
 

Backpack III.java

Backpack III.java

 
 

Backpack IV.java

Backpack IV.java

 
 

Backpack IX.java

Backpack IX.java

 
 

Backpack V.java

Backpack V.java

 
 

Backpack VII.java

Backpack VII.java

 
 

Backpack VIII.java

Backpack VIII.java

 
 

Backpack X.java

Backpack X.java

 
 

Backpack.java

Backpack.java

 
 

Balanced Binary Tree.java

Balanced Binary Tree.java

 
 

Beautiful Arrangement II.java

Beautiful Arrangement II.java

 
 

Beautiful Arrangement.java

Beautiful Arrangement.java

 
 

Best Time to Buy and Sell Stock I.java

Best Time to Buy and Sell Stock I.java

 
 

Best Time to Buy and Sell Stock II.java

Best Time to Buy and Sell Stock II.java

 
 

Best Time to Buy and Sell Stock III .java

Best Time to Buy and Sell Stock III .java

 
 

Best Time to Buy and Sell Stock IV.java

Best Time to Buy and Sell Stock IV.java

 
 

Big Integer multiplication.java

Big Integer multiplication.java

 
 

Binary Search Tree Iterator.java

Binary Search Tree Iterator.java

 
 

Binary Tree Inorder Traversal.java

Binary Tree Inorder Traversal.java

 
 

Binary Tree Level Order Traversal II.java

Binary Tree Level Order Traversal II.java

 
 

Binary Tree Level Order Traversal.java

Binary Tree Level Order Traversal.java

 
 

Binary Tree Maximum Node.java

Binary Tree Maximum Node.java

 
 

Binary Tree Maximum Path Sum.java

Binary Tree Maximum Path Sum.java

 
 

Binary Tree Path Sum.java

Binary Tree Path Sum.java

 
 

Binary Tree Postorder Traversal.java

Binary Tree Postorder Traversal.java

 
 

Binary Tree Preorder Traversal.java

Binary Tree Preorder Traversal.java

 
 

Binary Tree Serialization.java

Binary Tree Serialization.java

 
 

Binary Tree Zigzag Level Order Traversal.java

Binary Tree Zigzag Level Order Traversal.java

 
 

Bitwise AND of Numbers Range.java

Bitwise AND of Numbers Range.java

 
 

BubbleSort Template.java

BubbleSort Template.java

 
 

BucketSort Template.java

BucketSort Template.java

 
 

Building Outline.java

Building Outline.java

 
 

Cable Car Ride.java

Cable Car Ride.java

 
 

Card Game.java

Card Game.java

 
 

Climbing Stairs.java

Climbing Stairs.java

 
 

Clone Binary Tree.java

Clone Binary Tree.java

 
 

Clone Graph.java

Clone Graph.java

 
 

Coin Change.java

Coin Change.java

 
 

Coins in a Line II.java

Coins in a Line II.java

 
 

Coins in a Line III.java

Coins in a Line III.java

 
 

Coins in a Line.java

Coins in a Line.java

 
 

Combination Sum II.java

Combination Sum II.java

 
 

Combination Sum.java

Combination Sum.java

 
 

Combinations.java

Combinations.java

 
 

Construct Binary Tree from Inorder and Postorder Traversal.java

Construct Binary Tree from Inorder and Postorder Traversal.java

 
 

Construct Binary Tree from Preorder and Inorder Traversal.java

Construct Binary Tree from Preorder and Inorder Traversal.java

 
 

Container With Most Water.java

Container With Most Water.java

 
 

Continuous Subarray Sum.java

Continuous Subarray Sum.java

 
 

Convert Binary Search Tree to Doubly Linked List.java

Convert Binary Search Tree to Doubly Linked List.java

 
 

Convert Expression to Reverse Polish Notation.java

Convert Expression to Reverse Polish Notation.java

 
 

Convert Sorted Array to Binary Search Tree With Minimal Height.java

Convert Sorted Array to Binary Search Tree With Minimal Height.java

 
 

Convert Sorted List to Binary Search Tree.java

Convert Sorted List to Binary Search Tree.java

 
 

Copy List with Random Pointer.java

Copy List with Random Pointer.java

 
 

Count 1 in Binary.java

Count 1 in Binary.java

 
 

Count Complete Tree Nodes.java

Count Complete Tree Nodes.java

 
 

Count of Smaller Number before itself.java

Count of Smaller Number before itself.java

 
 

Course Schedule II.java

Course Schedule II.java

 
 

Course Schedule.java

Course Schedule.java

 
 

Data Segmentation.java

Data Segmentation.java

 
 

Data Stream Median.java

Data Stream Median.java

 
 

Deliver The Message.java

Deliver The Message.java

 
 

Digit Counts.java

Digit Counts.java

 
 

Directed Graph Loop.java

Directed Graph Loop.java

 
 

Distinct Subsequences.java

Distinct Subsequences.java

 
 

Divide Two Integers.java

Divide Two Integers.java

 
 

Dyeing Problem.java

Dyeing Problem.java

 
 

Edit Distance II.java

Edit Distance II.java

 
 

Edit Distance.java

Edit Distance.java

 
 

Equal Tree Partition.java

Equal Tree Partition.java

 
 

Evaluate Reverse Polish Notation.java

Evaluate Reverse Polish Notation.java

 
 

Fast Power.java

Fast Power.java

 
 

Fermat Point Of Graphs.java

Fermat Point Of Graphs.java

 
 

Find Minimum in Rotated Sorted Array II.java

Find Minimum in Rotated Sorted Array II.java

 
 

Find Minimum in Rotated Sorted Array.java

Find Minimum in Rotated Sorted Array.java

 
 

Find Peak Element.java

Find Peak Element.java

 
 

Find Substring.java

Find Substring.java

 
 

Find the Connected Component in the Undirected Graph.java

Find the Connected Component in the Undirected Graph.java

 
 

Find the Derangement of An Array.java

Find the Derangement of An Array.java

 
 

Find the Weak Connected Component in the Directed Graph.java

Find the Weak Connected Component in the Directed Graph.java

 
 

First Bad Version.java

First Bad Version.java

 
 

First Position of Target.java

First Position of Target.java

 
 

Flip Bits.java

Flip Bits.java

 
 

Four Numbers Multiply Problem.java

Four Numbers Multiply Problem.java

 
 

Graph Valid Tree.java

Graph Valid Tree.java

 
 

Group Anagrams.java

Group Anagrams.java

 
 

Guess Number Game II.java

Guess Number Game II.java

 
 

Guess Number Game.java

Guess Number Game.java

 
 

H-Index II.java

H-Index II.java

 
 

H-Index.java

H-Index.java

 
 

Repository files navigation

LintCode

这记载了我的LintCode刷题历程以及对应各个题目的思路总结。 如果你们有更好的解法，欢迎交流~~~

About

LintCode各题解法分析~ Coding For Fun

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%