Leetcode Diary

39.40 Combination Sum(I II)

Leetcode Diary

39 Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. The...

Posted by Xudong on August 29, 2020

38. Count and Say

Leetcode Diary

39 The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as "one 1" or 11. ...

Posted by Xudong on August 29, 2020

Leetcode diary Lc37

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc36

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc35

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc34

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc33

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc32

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc31

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

Leetcode diary Lc30

Leetcode Diary

Example: Thoughts Code(JAVA)

Posted by Xudong on July 26, 2020

FEATURED TAGS
easy medium math hard string dynamic programming two pointers array backtracking linkedlist
ABOUT ME

Invictus maneo.

✉️ xudongliucc@gmail.com

FRIENDS