Skip to content

YanliSai/LeetCode-1

BranchesTags
 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

47 Commits
3Sum_2Points_dupGuard.cpp
3Sum_2Points_dupGuard.cpp
 
 
3Sum_2Points_set_TLE.cpp
3Sum_2Points_set_TLE.cpp
 
 
3Sum_Closest_2Points_dupGuard.cpp
3Sum_Closest_2Points_dupGuard.cpp
 
 
3Sum_hash.py
3Sum_hash.py
 
 
3Sum_iter_prune.cpp
3Sum_iter_prune.cpp
 
 
4Sum_2Points_dupGuard.cpp
4Sum_2Points_dupGuard.cpp
 
 
4Sum_DFS_TLE.py
4Sum_DFS_TLE.py
 
 
4Sum_hash.cpp
4Sum_hash.cpp
 
 
4Sum_hash.py
4Sum_hash.py
 
 
4Sum_hash_2Points.py
4Sum_hash_2Points.py
 
 
4Sum_hash_2Points_dupGuard_prune.cpp
4Sum_hash_2Points_dupGuard_prune.cpp
 
 
4Sum_hash_2Points_dupGuard_prune.py
4Sum_hash_2Points_dupGuard_prune.py
 
 
4Sum_hash_2Points_revise.py
4Sum_hash_2Points_revise.py
 
 
4Sum_hash_dupGuard_prune.cpp
4Sum_hash_dupGuard_prune.cpp
 
 
4Sum_hash_dupGuard_prune_multimap.cpp
4Sum_hash_dupGuard_prune_multimap.cpp
 
 
4Sum_hash_revise.py
4Sum_hash_revise.py
 
 
4Sum_iter_BruteForce_TLE.cpp
4Sum_iter_BruteForce_TLE.cpp
 
 
4Sum_iter_prune.cpp
4Sum_iter_prune.cpp
 
 
4Sum_map_2Points_dupGuard_prune.cpp
4Sum_map_2Points_dupGuard_prune.cpp
 
 
AddTwoNumbers.cpp
AddTwoNumbers.cpp
 
 
AddTwoNumbers_iter.cpp
AddTwoNumbers_iter.cpp
 
 
AddTwoNumbers_iter_short.cpp
AddTwoNumbers_iter_short.cpp
 
 
Add_Binary.cpp
Add_Binary.cpp
 
 
Add_Binary.py
Add_Binary.py
 
 
Add_Binary_int_bitset.cpp
Add_Binary_int_bitset.cpp
 
 
Anagrams.cpp
Anagrams.cpp
 
 
Anagrams.py
Anagrams.py
 
 
Best_Time_to_Buy_and_Sell_Stock.cpp
Best_Time_to_Buy_and_Sell_Stock.cpp
 
 
Best_Time_to_Buy_and_Sell_Stock_II.cpp
Best_Time_to_Buy_and_Sell_Stock_II.cpp
 
 
Best_Time_to_Buy_and_Sell_Stock_III.cpp
Best_Time_to_Buy_and_Sell_Stock_III.cpp
 
 
Binary_Tree_Inorder_Traversal.py
Binary_Tree_Inorder_Traversal.py
 
 
Binary_Tree_Inorder_Traversal_iter.cpp
Binary_Tree_Inorder_Traversal_iter.cpp
 
 
Binary_Tree_Level_Order_Traversal.cpp
Binary_Tree_Level_Order_Traversal.cpp
 
 
Binary_Tree_Level_Order_Traversal.py
Binary_Tree_Level_Order_Traversal.py
 
 
Binary_Tree_Level_Order_Traversal_II.cpp
Binary_Tree_Level_Order_Traversal_II.cpp
 
 
Binary_Tree_Maximum_Path_Sum.cpp
Binary_Tree_Maximum_Path_Sum.cpp
 
 
Binary_Tree_Postorder_Traversal_iter.cpp
Binary_Tree_Postorder_Traversal_iter.cpp
 
 
Binary_Tree_Postorder_Traversal_rec.cpp
Binary_Tree_Postorder_Traversal_rec.cpp
 
 
Binary_Tree_Preorder_Traversal_iter.cpp
Binary_Tree_Preorder_Traversal_iter.cpp
 
 
Binary_Tree_Preorder_Traversal_rec.cpp
Binary_Tree_Preorder_Traversal_rec.cpp
 
 
Binary_Tree_Preorder_Traversal_rec.py
Binary_Tree_Preorder_Traversal_rec.py
 
 
Binary_Tree_Zigzag_Level_Order_Traversal.py
Binary_Tree_Zigzag_Level_Order_Traversal.py
 
 
Climbing_Stairs.cpp
Climbing_Stairs.cpp
 
 
Clone_Graph.cpp
Clone_Graph.cpp
 
 
Clone_Graph.py
Clone_Graph.py
 
 
Combination_Sum.cpp
Combination_Sum.cpp
 
 
Combination_Sum.py
Combination_Sum.py
 
 
Combination_Sum_II.cpp
Combination_Sum_II.cpp
 
 
Combination_Sum_II.py
Combination_Sum_II.py
 
 
Combination_Sum_tailcall_opt.cpp
Combination_Sum_tailcall_opt.cpp
 
 
Combination_Sum_tailcall_opt.py
Combination_Sum_tailcall_opt.py
 
 
Combinations.cpp
Combinations.cpp
 
 
Combinations.py
Combinations.py
 
 
Combinations_duplicates.cpp
Combinations_duplicates.cpp
 
 
Combinations_duplicates.py
Combinations_duplicates.py
 
 
Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp
Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.cpp
 
 
Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.py
Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.py
 
 
Container_With_Most_Water.cpp
Container_With_Most_Water.cpp
 
 
Container_With_Most_Water.py
Container_With_Most_Water.py
 
 
Convert_Sorted_Array_to_Binary_Search_Tree.cpp
Convert_Sorted_Array_to_Binary_Search_Tree.cpp
 
 
Convert_Sorted_List_to_Binary_Search_Tree.cpp
Convert_Sorted_List_to_Binary_Search_Tree.cpp
 
 
Copy_List_with_Random_Pointer.cpp
Copy_List_with_Random_Pointer.cpp
 
 
Copy_List_with_Random_Pointer.py
Copy_List_with_Random_Pointer.py
 
 
Count_and_Say.py
Count_and_Say.py
 
 
Decode_Ways_DP.cpp
Decode_Ways_DP.cpp
 
 
Divide_Two_Integers.cpp
Divide_Two_Integers.cpp
 
 
Evaluate_Reverse_Polish_Notation.cpp
Evaluate_Reverse_Polish_Notation.cpp
 
 
Evaluate_Reverse_Polish_Notation.py
Evaluate_Reverse_Polish_Notation.py
 
 
First_Missing_Positive.cpp
First_Missing_Positive.cpp
 
 
Flatten_Binary_Tree_to_Linked_List.cpp
Flatten_Binary_Tree_to_Linked_List.cpp
 
 
Gas_Station_bruteForce_TLE.cpp
Gas_Station_bruteForce_TLE.cpp
 
 
Generate_Parentheses_bruteForce.py
Generate_Parentheses_bruteForce.py
 
 
Gray_Code.cpp
Gray_Code.cpp
 
 
Gray_Code.py
Gray_Code.py
 
 
Gray_Code_L2R.py
Gray_Code_L2R.py
 
 
Insert_Interval.cpp
Insert_Interval.cpp
 
 
Integer_to_Roman.py
Integer_to_Roman.py
 
 
Interleaving_String_DFS_TLE.cpp
Interleaving_String_DFS_TLE.cpp
 
 
Interleaving_String_DP.cpp
Interleaving_String_DP.cpp
 
 
Length_of_Last_Word.cpp
Length_of_Last_Word.cpp
 
 
Length_of_Last_Word.py
Length_of_Last_Word.py
 
 
Letter_Combinations_of_a_Phone_Number.cpp
Letter_Combinations_of_a_Phone_Number.cpp
 
 
Letter_Combinations_of_a_Phone_Number.py
Letter_Combinations_of_a_Phone_Number.py
 
 
Linked_List_Cycle_II.cpp
Linked_List_Cycle_II.cpp
 
 
ListNode.hpp
ListNode.hpp
 
 
Longest_Common_Prefix.cpp
Longest_Common_Prefix.cpp
 
 
Longest_Common_Prefix.py
Longest_Common_Prefix.py
 
 
Longest_Consecutive_Sequence.cpp
Longest_Consecutive_Sequence.cpp
 
 
Longest_Consecutive_Sequence.py
Longest_Consecutive_Sequence.py
 
 
Longest_Palindromic_Substring.cpp
Longest_Palindromic_Substring.cpp
 
 
Longest_Substring_Without_Repeating_Characters.cpp
Longest_Substring_Without_Repeating_Characters.cpp
 
 
Max_Points_on_a_Line.py
Max_Points_on_a_Line.py
 
 
Maximum_Subarray_DP.cpp
Maximum_Subarray_DP.cpp
 
 
Maximum_Subarray_naive.cpp
Maximum_Subarray_naive.cpp
 
 
Merge_Intervals.cpp
Merge_Intervals.cpp
 
 
Merge_Intervals_stack.py
Merge_Intervals_stack.py
 
 
Merge_Sorted_Array.cpp
Merge_Sorted_Array.cpp
 
 
Minimum_Path_Sum.cpp
Minimum_Path_Sum.cpp
 
 
NSum_rec_prune.cpp
NSum_rec_prune.cpp
 
 
N_Queens.py
N_Queens.py
 
 

Repository files navigation

LeetCode

Progress

126/151

Other Solutions

自定义搜索LeetCode

Associated Documents and Resources

Peter norvig神牛Python代码写的很飘逸,果然是有LISP内功的人!
Udacity CS212
Solving Every Sudoku Puzzle

Binary Search Tree In-Order Traversal Iterative Solution Binary Tree Post-Order Traversal Iterative Solution

进军硅谷: 程序员面试揭秘 本书涉嫌抄袭leetcode,特此注明

题目分类

from http://blog.csdn.net/fightforyourdream/article/details/12705509 ###Dynamic Programming

Edit Distance
Maximum Subarray
Minimum Path Sum
Unique Paths
Unique Paths II
Longest Palindromic Substring
Interleaving String
Triangle
Distinct Subsequences
Decode Ways
Palindrome Partitioning II
Maximal Rectangle

###Recursion

N-Queens
N-Queens II
Balanced Binary Tree
Binary Tree Inorder Traversal
Binary Tree Maximum Path Sum
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Flatten Binary Tree to Linked List
Maximum Depth of Binary Tree
Minimum Depth of Binary Tree
Path Sum
Permutations
Permutations II
Populating Next Right Pointers in Each Node
Pow(x, n)
Same Tree
Subsets
Sum Root to Leaf Numbers
Swap Nodes in Pairs
Symmetric Tree
Valid Palindrome
Validate Binary Search Tree
Restore IP Addresses Combinations
Interleaving String (dp is the best)
Combination Sum II
Letter Combinations of a Phone Numbers
Word Search
Construct Binary Tree from Inorder and Postorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal
Generate Parentheses
Surrounded Regions (runtime error)
Palindrome Partitioning
Combination Sum
Sudoku Solver
Unique Binary Search Trees II

###Binary Search

Search Insert Position
Search a 2D Matrix
Search for a Range
Search in Rotated Sorted Array Sqrt(x)

###Sequence

Container With Most Water
Count and Say
First Missing Positive
Implement strStr()
Jump Game
Jump Game II
Length of Last Word
Longest Common Prefix
Longest Substring Without Repeating Characters
Merge Sorted Array
Palindrome Number
Plus One
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array II
Remove Element
Reverse Integer
Search in Rotated Sorted Array II
Sort Colors
Two Sum
3Sum
3Sum Closest
4Sum
Add Binary
Longest Palindromic Substring
Next Permutation
Longest Valid Parentheses
Climbing Stairs
Permutation Sequence
Simplify Path
String to Integer (atoi)
Minimum Window Substring
Longest Consecutive Sequence
Trapping Rain Water
Valid Number

###Linked List

Add Two Numbers
Convert Sorted List to Binary Search Tree
Merge Two Sorted Lists
Partition List
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Nth Node From End of List
Reverse Linked List II
Reverse Nodes in k-Group
Rotate List
Swap Nodes in Pairs

###Stack

Binary Tree Inorder Traversal
Binary Tree Level Order Traversal II
Valid Parentheses

###Queue

Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Populating Next Right Pointers in Each Node II
Symmetric Tree
Surrounded Regions
Word Ladder

###Tree

Balanced Binary Tree
Binary Tree Inorder Traversal
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Binary Tree Maximum Path Sum
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Flatten Binary Tree to Linked List
Maximum Depth of Binary Tree
Minimum Depth of Binary Tree
Path Sum
Same Tree
Sum Root to Leaf Numbers
Symmetric Tree
Validate Binary Search Tree

TODO

  • Longest_Palindromic_Substring.cpp
  • subset -> combination -> n-sum blog
  • Substring_with_Concatenation_of_All_Words_bruteForce.py non-trival solution (brute force: O(len(S)*Len(L[0])) 832ms) (not found)
  • Divide_Two_Integers.cpp abc() 结果是负数...
  • Single_Number_II.cpp
  • Permutation II none trival solution (not set, constant memory, no next_permutation, just recurrsion with extra-branching rules dealing with duplicates)
  • Permutation II amortize solution like Combinations.py
  • write summation about Permutation
    • $[e| e <- lst]*Permutation(lst-e)$ branch: take every element as head element
    • insert e everywhere
    • next_permutation
  • list reverse 类总结，写blog, 介绍我的reverseFrom函数
  • First_Missing_Positive.cpp review
  • Best_Time_to_Buy_and_Sell_Stock.cpp
  • Word_Search.py 和 Word_Search_copyPath.py 以及 cpp 版本整理写一篇blog. DFS状态，复制/共享<=>面向过程/函数式<=>效率/简洁
  • Generate_Parentheses_bruteForce.py why insert () every where make all valid parentheses?
  • Combination_Sum_II.cpp condition not understand
  • Combination_Sum_tailcall_opt.cpp too slow
  • Two_Sum.py better solution?
  • Unique_Binary_Search_Trees_II_DP.cpp
  • Sort_Colors_1pass.cpp
  • Sort_List.cpp
    • revise quickSort version;
    • write merge sort version;
    • iterative ?
  • Linked_List_Cycle_II.cpp review,discuss
  • Simplify_Path.py cpp version
  • binary tree traversal PreOrder, InOrder, PostOrder, wiki
    • recursive traversal
    • iterative traversal with stack
    • Threaded binary tree (morris ...)
  • iterative tree-like struct traverse
  • 整理word break和word break II的资料，写一篇blog
    • Top down memoization VS Bottom up Dynamic Programming: check DP implemetation
    • review Udacity CS212 and Udacity Programming Languages
  • 刷过的题目整理丢github
  • Populating_Next_Right_Pointers_in_Each_Node.cpp too slow and looks bad for myself, check other's implemetation
  • Longest_Substring_Without_Repeating_Characters.cpp 用数组当索引重新实现一次

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published