lintcode java_Lintcode-java版本

【实例简介】

java程序员有福利了，刷题必备，lintcode的java版本，Renfei Wang大神！

LintCode Book

Word pattern

2.14

Flip game

2.15

Flip Game‖

2.16

Reverse Words in a String

2.17

Reverse Words in a string ll

2.18

String permutation

2.19

Digit Counts

2.20

Integer to Roman

2.21

Roman to Integer

2.22

Palindrome permutation

2.23

Valid palindrome

2.24

somorphic Strings

2.25

Strobogrammatic Number

2.26

Strobogrammatic Number l

2.27

String to Integer(atoi)

2.28

Encode and Decode Strings

2.29

Group Anagrams

2.30

Longest Palindromic Substring

2.31

Integer to English Words

2.32

Unique Word Abbreviation

2.33

Generalized abbreviation

2.34

Scramble String

2.35

Read n characters Given read4

2.36

Read n characters Given read4 l

2.37

Regular Expression Matching

2.38

Wildcard Matching

2.39

Basic calculator

2.40

Basic calculator ll

2.41

Remove Duplicate Letters

2.42

Shortest palindrome

2.43

LintCode Book

Palindrome pairs

2.44

Binary Search

Binary Search

3.1

Search 2D Matrix

3.2

Search2 D Matrix‖

3.3

Find peak element

3.4

Find Minimun in Rotated Sorted Array

3.5

Find Minimun in Rotated Sorted Array ll

Search in Rotated Sorted Array

3.7

Search in Rotated Sorted Array I

3.8

Closest Number in Sorted Array

3.9

Search In a Big Sorted Array

Total Occurrence of Target

3.11

First bad∨ ersion

3.12

Search For a range

3.13

Search Insert Position

3.14

Wood cut

Smallest Rectangle Enclosing black Pixels

3.16

Binary Tree

Binary Tree Paths

4.1

Maximum Depth

4.2

Minimum Depth

4.3

Invert Binary Tree

4.4

Convert Sorted Array to bsT in minimum height

4.5

Subtree

4.6

Insert node in bst

4.7

Two Sum in bst

4.8

Closest Binary Search Tree Value

4.9

Closest Binary Search Tree Value Il

4.10

Pre Order Traversal

4.11

LintCode Book

In Order traversal

4.12

Post order Traversal

4.13

Level order traversa

4.14

Level order Traversal ll

4.15

Binary Tree Zigzag Level Order Traversal

4.16

Binary Tree Vertical Order Traversal

4.17

Verify Preorder Sequence in Binary Search Tree

4.18

Binary Tree Right Side

4.19

Populating next Right Pointers in Each Node

4.20

Populating Next Right Pointers in Each Node

4.21

Verify Preorder Serialization of a Binary Tree

4.22

Complete Binary Tree

4.23

Symmetric Binary Tree

4.24

Segment Tree Build

4.25

Segment Tree Build Il

4.26

Segment Tree Query

4.27

Segment Tree Modify

4.28

Flatten Binary Tree to Linked List

4.29

Binary Tree From in and post order

4.30

Binary Tree From in and pre order

4.31

Binary Tree Path Sum

4.32

Binary Tree Path Sum‖

4.33

Binary Tree Longest Consecutive Sequence

4.34

Binary Search Tree Iterator

4.35

Lowest Common ancestor

4.36

Inorder successor In bst

4.37

Balanced Binary Tree

4.38

TWeaked Identical Binary Tree

4.39

Search Range in Binary Search Tree

4.40

Validate Binary Search Tree

4.41

LintCode Book

Largest bsT Subtree

4.42

Binary Tree Maximum Path Sum Il

4.43

Binary Tree Maximum Path Sum

4.44

Sum root to leaf numbers

4.45

Recover Binary Search Tree

4.46

Count Univalue subtrees

4.47

Count Complete Tree Nodes

4.48

Kth smallest element in a bst

4.49

Binary Tree Upside Down

4.50

Dynamic Programming

5

Range Sum Query -Immutable

5.1

Longest Increasing Continuous Subsequence

52

Triangle

5.3

Climbing Stairs

54

House robber

5.5

ouse robber‖l

5.6

ouse robber‖

5.7

Paint fence

5.8

Paint House

5.9

Integer Break

5.10

Maximum Product Subarray

5.11

Minimum path sum

5.12

Unique Paths

5.13

nique Paths

5.14

Maximal Square

5.15

Jump game

5.16

Jump Game l

5.17

Longest Increasing Subsequence

5.18

Increasing Triplet Subsequence

5.19

Palindrome Partitioning ll

5.20

LintCode Book

Word break

5.21

Longest Common Subsequence

5.22

Longest Common Substring

523

Distinct Subsequences

5.24

Edit distance

5.25

One Edit Distance

5.26

Interleaving String

527

Unique Binary Search Trees

5.

28

Unique Binary Search Trees Il

5.29

Backpack I

5.30

Backpack‖l

5.31

Coins In a line

5.32

Coins in a line‖

5.33

Coins In a line‖

34

Coin Change

5.35

Burst balloons

5.36

Sort

Merge Intervals

6.1

Insert Interval

6.2

Merge Sorted Array

6.3

Merge Sorted Array‖l

6.4

Insertion Sort list

6.5

Sort Letters by Case

66

Sort color

6.7

Sort Color l

6.8

Wiggle Sort

6.9

Wiggle Sort Il

6.10

Three sum

6.11

Three Sum closest

6.12

Three sum smaller

LintCode Book

Four sum

6.14

Largest Number

6.15

Partition Array

6.16

Count of smaller numbers after self

6.17

Count of Range sum

6.18

Two Pointers

Move Zeroes

7.1

Kth Largest Element

7.2

Remove Element

Remove Duplicates from Sorted Array

7.4

Remove Duplicates from Sorted Array ll

7.5

Two Sum

7.6

TWo Sun‖l

Trapping Rain Water

7.8

Container with most water

7.9

The smallest Difference

7.10

Minimum Size Subarray sum

7.11

Maximum Size Subarray Sum Equals k

7.12

Longest Substring Without Repeating Characters

7.13

Minimum Window Substring

7.14

K Closest Numbers In Sorted Array

7.15

Longest Substring with At Most K Distinct Characters

7.16

Nuts bolts problem

7.17

A

rra

Shuffle an Array

8.1

Summary Ranges

8.2

Missing Ranges

8.3

Gas Station

8.4

Making New list

8.5

Rotate Array

8.6

LintCode Book

Shortest Word Distance

8.7

Shortest Word Distance I

8.8

Shortest Word Distance lll

8.9

Spiral Matrix

8.10

Spiral Matrix‖

8.11

Single Number

8.12

Single Number Il

8.13

Single Number Ill

8.14

Majority Number

8.15

Majority Number

8.16

Majority Number Il

8.17

Product of Array Exclude Itself

8.18

Recover Rotated Sorted Array

8.19

Rotate String

8.20

Best Meeting point

8.21

Patching Array

8.22

H-Index

8.23

H-Index-lI

8.24

Maximum Subarray

8.25

Maximum Subarray‖l

8.26

Maximum Subarray I‖l

8.27

Minimum Subarray

8.28

Maximum Subarray Difference

8.29

Subarray Sul

8.30

Subarray Sum Closest

8.31

Best Time to Buy and sell Stock

8.32

Best Time to Buy and Sell Stock Il

8.33

Best Time to Buy and Sell Stock Ill

8.34

Best Time to Buy and sell Stock with Cooldown

8.35

Set matrix Zeroes

8.36

LintCode Book

Game of life

8.37

Median of two Sorted Arrays

8.38

Find the Duplicate Number

8.39

First Missing Positive

8.40

Linkedlist

Delete Node in the Middle of Singly Linked List

9.1

Reverse Linked List

9.2

Reverse linked list‖l

Palindrome linked list

94

Partition list

9.5

Nth to last node in list

9.6

Remove nth node from end of list

9.7

Remove Linked list elements

Remove Duplicates From Sorted List

9.9

Remove Duplicates From Sorted List ll

9.10

Remove Duplicates From UnSorted List

9.11

Linked List Cycle

9.12

Linked List Cycle‖l

9.13

Swap Nodes in Pairs

9.14

Intersection of two linked lists

9.15

Merge Two Sorted Lists

9.16

Merge K Sorted Lists

Sort List

9.18

Insertion Sort list

9.19

Reorder list

9.20

Add two numbers

9.21

Rotate list

9.22

Copy List With Random Pointer

9.23

Convert Sorted List to Binary Search Tree

9.24

Convert Binary Search Tree to Doubly Linked List

9.25

【实例截图】

【核心代码】