GitHub - jnozsc/leetcode: my solution in C++

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 288 Commits
3Sum.cpp		3Sum.cpp
3Sum_Closest.cpp		3Sum_Closest.cpp
4Sum.cpp		4Sum.cpp
Add_Binary.cpp		Add_Binary.cpp
Add_Two_Numbers.cpp		Add_Two_Numbers.cpp
Anagrams.cpp		Anagrams.cpp
Balanced_Binary_Tree.cpp		Balanced_Binary_Tree.cpp
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.cpp		Binary_Tree_Inorder_Traversal.cpp
Binary_Tree_Level_Order_Traversal.cpp		Binary_Tree_Level_Order_Traversal.cpp
Binary_Tree_Level_Order_Traversal_BFS.cpp		Binary_Tree_Level_Order_Traversal_BFS.cpp
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.cpp		Binary_Tree_Postorder_Traversal.cpp
Binary_Tree_Postorder_Traversal_iterate.cpp		Binary_Tree_Postorder_Traversal_iterate.cpp
Binary_Tree_Preorder_Traversal.cpp		Binary_Tree_Preorder_Traversal.cpp
Binary_Tree_Preorder_Traversal_iterate.cpp		Binary_Tree_Preorder_Traversal_iterate.cpp
Binary_Tree_Zigzag_Level_Order_Traversal.cpp		Binary_Tree_Zigzag_Level_Order_Traversal.cpp
Candy.cpp		Candy.cpp
Climbing_Stairs.cpp		Climbing_Stairs.cpp
Clone_Graph.cpp		Clone_Graph.cpp
Combination_Sum.cpp		Combination_Sum.cpp
Combination_Sum_II.cpp		Combination_Sum_II.cpp
Combinations.cpp		Combinations.cpp
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.cpp		Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp
Container_With_Most_Water.cpp		Container_With_Most_Water.cpp
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
Count_and_Say.cpp		Count_and_Say.cpp
Decode_Ways.cpp		Decode_Ways.cpp
Distinct_Subsequences.cpp		Distinct_Subsequences.cpp
Divide_Two_Integers.cpp		Divide_Two_Integers.cpp
Edit_Distance.cpp		Edit_Distance.cpp
Evaluate_Reverse_Polish_Notation.cpp		Evaluate_Reverse_Polish_Notation.cpp
Find_Minimum_in_Rotated_Sorted_Array.cpp		Find_Minimum_in_Rotated_Sorted_Array.cpp
Find_Minimum_in_Rotated_Sorted_Array_II.cpp		Find_Minimum_in_Rotated_Sorted_Array_II.cpp
Find_Peak_Element.cpp		Find_Peak_Element.cpp
First_Missing_Positive.cpp		First_Missing_Positive.cpp
Flatten_Binary_Tree_to_Linked_List.cpp		Flatten_Binary_Tree_to_Linked_List.cpp
Gas_Station.cpp		Gas_Station.cpp
Generate_Parentheses.cpp		Generate_Parentheses.cpp
Gray_Code.cpp		Gray_Code.cpp
Implement_strStr.cpp		Implement_strStr.cpp
Insert_Interval.cpp		Insert_Interval.cpp
Insertion_Sort_List.cpp		Insertion_Sort_List.cpp
Integer_to_Roman.cpp		Integer_to_Roman.cpp
Interleaving_String.cpp		Interleaving_String.cpp
Intersection_of_Two_Linked_Lists.cpp		Intersection_of_Two_Linked_Lists.cpp
Jump_Game.cpp		Jump_Game.cpp
Jump_Game_II.cpp		Jump_Game_II.cpp
LRU_Cache.cpp		LRU_Cache.cpp
Largest_Rectangle_in_Histogram.cpp		Largest_Rectangle_in_Histogram.cpp
Length_of_Last_Word.cpp		Length_of_Last_Word.cpp
Letter_Combinations_of_a_Phone_Number.cpp		Letter_Combinations_of_a_Phone_Number.cpp
Linked_List_Cycle.cpp		Linked_List_Cycle.cpp
Linked_List_Cycle_II.cpp		Linked_List_Cycle_II.cpp
Longest_Common_Prefix.cpp		Longest_Common_Prefix.cpp
Longest_Consecutive_Sequence.cpp		Longest_Consecutive_Sequence.cpp
Longest_Palindromic_Substring.cpp		Longest_Palindromic_Substring.cpp
Longest_Substring_Without_Repeating_Characters.cpp		Longest_Substring_Without_Repeating_Characters.cpp
Longest_Valid_Parentheses.cpp		Longest_Valid_Parentheses.cpp
Max_Points_on_a_Line.cpp		Max_Points_on_a_Line.cpp
Maximal_Rectangle.cpp		Maximal_Rectangle.cpp
Maximum_Depth_of_Binary_Tree.cpp		Maximum_Depth_of_Binary_Tree.cpp
Maximum_Product_Subarray.cpp		Maximum_Product_Subarray.cpp
Maximum_Subarray.cpp		Maximum_Subarray.cpp
Median_of_Two_Sorted_Arrays.cpp		Median_of_Two_Sorted_Arrays.cpp
Merge_Intervals.cpp		Merge_Intervals.cpp
Merge_Sorted_Array.cpp		Merge_Sorted_Array.cpp
Merge_Two_Sorted_Lists.cpp		Merge_Two_Sorted_Lists.cpp
Merge_k_Sorted_Lists.cpp		Merge_k_Sorted_Lists.cpp
Min_Stack.cpp		Min_Stack.cpp
Minimum_Depth_of_Binary_Tree.cpp		Minimum_Depth_of_Binary_Tree.cpp
Minimum_Path_Sum.cpp		Minimum_Path_Sum.cpp
Minimum_Window_Substring.cpp		Minimum_Window_Substring.cpp
Multiply_Strings.cpp		Multiply_Strings.cpp
N-Queens.cpp		N-Queens.cpp
N-Queens_II.cpp		N-Queens_II.cpp
Next_Permutation.cpp		Next_Permutation.cpp
Palindrome_Number.cpp		Palindrome_Number.cpp
Palindrome_Partitioning.cpp		Palindrome_Partitioning.cpp
Palindrome_Partitioning_II.cpp		Palindrome_Partitioning_II.cpp
Partition_List.cpp		Partition_List.cpp
Pascal_s_Triangle.cpp		Pascal_s_Triangle.cpp
Pascal_s_Triangle_II.cpp		Pascal_s_Triangle_II.cpp
Path_Sum.cpp		Path_Sum.cpp
Path_Sum_II.cpp		Path_Sum_II.cpp
Permutation_Sequence.cpp		Permutation_Sequence.cpp
Permutations.cpp		Permutations.cpp
Permutations_II.cpp		Permutations_II.cpp
Plus_One.cpp		Plus_One.cpp
Populating_Next_Right_Pointers_in_Each_Node.cpp		Populating_Next_Right_Pointers_in_Each_Node.cpp
Populating_Next_Right_Pointers_in_Each_Node_II.cpp		Populating_Next_Right_Pointers_in_Each_Node_II.cpp
Pow.cpp		Pow.cpp
README.md		README.md
Recover_Binary_Search_Tree.cpp		Recover_Binary_Search_Tree.cpp

Repository files navigation

too many Time Limit Exceeded too stupid me

题目总结

数学题

题目	说明
ZigZag Conversion	这题比较绕，最简单的数学，做好边界处理
Reverse Integer	很简单，但是不要忘了 overflow check
String to Integer(atoi)	overflow check 和 isspace 等check
Roman to Integer	map题目，背
Integer to Roman	map题目，背
Divide Two Integers	位运算永远的痛，背
Next Permutation	这题除非数学系，不可能做出来，背
First Missing Positive	这题从来没懂过，还需要重做
Letter Combinations of a Phone Number	表面是 DFS，其实用罗马转数字的方法更好
Pow(x, n)	这题巧在绝对不能 if (n < 0) return pow(1 / x, -n) 会越界
Plus One	简单屌丝题目
Valid Number	各种情况，遇题目就问面试官吧
Sqrt(x)	牛顿公式，背
Edit Distance	Levenshtein distance 公式＋ dp
Sort Colors	荷兰旗算法
Permutation Sequence	绝对做不出来之二，字典序算法
Maximal Rectangle & Largest Rectangle in Histogram	两个题是一个题目
Gray Code	格雷码，背
Single Number	XOR
Single Number 2	根本不可能理解，背

dp 题

TODO

jnozsc/leetcode

Folders and files

Latest commit

History