LeetCode

A simple Leetcode answer. Header file "inc.h" has some simple function to create tree, print vector or tree.

Name		Name	Last commit message	Last commit date
Latest commit History 139 Commits
.vscode		.vscode
a.out.dSYM/Contents		a.out.dSYM/Contents
.DS_Store		.DS_Store
.gitignore		.gitignore
10. Regular Expression Matching.cpp		10. Regular Expression Matching.cpp
1032.StreamOfCharactor.cpp		1032.StreamOfCharactor.cpp
124. Binary Tree Maximum Path Sum.cpp		124. Binary Tree Maximum Path Sum.cpp
127. Word Ladder.cpp		127. Word Ladder.cpp
134. Gas Station.cpp		134. Gas Station.cpp
137. Single Number II.cpp		137. Single Number II.cpp
138. Copy List with Random Pointer.cpp		138. Copy List with Random Pointer.cpp
141. Linked List Cycle.cpp		141. Linked List Cycle.cpp
142. Linked List Cycle II.cpp		142. Linked List Cycle II.cpp
143. Reorder List.cpp		143. Reorder List.cpp
147. Insertion Sort List.cpp		147. Insertion Sort List.cpp
148. Sort List.cpp		148. Sort List.cpp
150. Evaluate Reverse Polish Notation.cpp		150. Evaluate Reverse Polish Notation.cpp
153. Find Minimum in Rotated Sorted Array.cpp		153. Find Minimum in Rotated Sorted Array.cpp
162. Find Peak Element.cpp		162. Find Peak Element.cpp
165. Compare Version Numbers.cpp		165. Compare Version Numbers.cpp
166. Fraction to Recurring Decimal.cpp		166. Fraction to Recurring Decimal.cpp
173. Binary Search Tree Iterator.cpp		173. Binary Search Tree Iterator.cpp
187. Repeated DNA Sequences.cpp		187. Repeated DNA Sequences.cpp
200. Number of Islands.cpp		200. Number of Islands.cpp
201. Bitwise AND of Numbers Range.cpp		201. Bitwise AND of Numbers Range.cpp
207. Course Schedule.cpp		207. Course Schedule.cpp
240. Search a 2D Matrix II.cpp		240. Search a 2D Matrix II.cpp
429. N-ary Tree Level Order Traversal.cpp		429. N-ary Tree Level Order Traversal.cpp
432.py		432.py
449. Serialize and Deserialize BST.cpp		449. Serialize and Deserialize BST.cpp
460. LFU Cache.cpp		460. LFU Cache.cpp
51. N-Queens.cpp		51. N-Queens.cpp
559. Maximum Depth of N-ary Tree.cpp		559. Maximum Depth of N-ary Tree.cpp
589. N-ary Tree Preorder Traversal.cpp		589. N-ary Tree Preorder Traversal.cpp
61. Rotate List.cpp		61. Rotate List.cpp
666. Path Sum IV.cpp		666. Path Sum IV.cpp
696. Count Binary Substrings.cpp		696. Count Binary Substrings.cpp
698. Partition to K Equal Sum Subsets.cpp		698. Partition to K Equal Sum Subsets.cpp
71. Simplify Path.cpp		71. Simplify Path.cpp
72. Edit Distance.cpp		72. Edit Distance.cpp
74. Search a 2D Matrix.cpp		74. Search a 2D Matrix.cpp
75. Sort Colors.cpp		75. Sort Colors.cpp
80. Remove Duplicates from Sorted Array II.cpp		80. Remove Duplicates from Sorted Array II.cpp
81. Search in Rotated Sorted Array II.cpp		81. Search in Rotated Sorted Array II.cpp
82. Remove Duplicates from Sorted List II.cpp		82. Remove Duplicates from Sorted List II.cpp
86. Partition List.cpp		86. Partition List.cpp
888.py		888.py
889.py		889.py
919Complete Binary Tree Inserter.cpp		919Complete Binary Tree Inserter.cpp
92. Reverse Linked List II.cpp		92. Reverse Linked List II.cpp
AddAndSearchWord.cpp		AddAndSearchWord.cpp
AddOneRowToTree.cpp		AddOneRowToTree.cpp
AverageOfLevelsInBinaryTree.cpp		AverageOfLevelsInBinaryTree.cpp
BaseballGame.cpp		BaseballGame.cpp
BeautifulArrangement.cpp		BeautifulArrangement.cpp
BinaryTreePostorderTraversal.cpp		BinaryTreePostorderTraversal.cpp
BinaryTreeRightSideView.cpp		BinaryTreeRightSideView.cpp
BinaryTreeZigzagLevelOrderTraversal.cpp		BinaryTreeZigzagLevelOrderTraversal.cpp
BulbSwitcher.cpp		BulbSwitcher.cpp
BulbSwitcher2.cpp		BulbSwitcher2.cpp
CombinationSum.cpp		CombinationSum.cpp
CombinationSum2.cpp		CombinationSum2.cpp
CombinationSum3.cpp		CombinationSum3.cpp
Combinations.cpp		Combinations.cpp
ConstructBinaryTreeFromInorderAndPostorderTraversal.cpp		ConstructBinaryTreeFromInorderAndPostorderTraversal.cpp
ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp		ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp
ConstructStringFromBinaryTree.cpp		ConstructStringFromBinaryTree.cpp
ContainerWithMostWater.cpp		ContainerWithMostWater.cpp
ContainsDuplicate3.cpp		ContainsDuplicate3.cpp
ConvertBstToGreaterTree.cpp		ConvertBstToGreaterTree.cpp
CountAndSay.cpp		CountAndSay.cpp
CountCompleteTreeNodes.cpp		CountCompleteTreeNodes.cpp
CountNumbersWithUniqueDigits.cpp		CountNumbersWithUniqueDigits.cpp
DeleteNodeInABST.cpp		DeleteNodeInABST.cpp
DistributeCandies.cpp		DistributeCandies.cpp
DungeonGame.cpp		DungeonGame.cpp
EqualTreePartition.cpp		EqualTreePartition.cpp
FindBottomLeftTreeValue.cpp		FindBottomLeftTreeValue.cpp
FindDuplicateSubtrees.cpp		FindDuplicateSubtrees.cpp
FindKClosestElements.cpp		FindKClosestElements.cpp
FindModeInBinarySearchTree.cpp		FindModeInBinarySearchTree.cpp
FlattenBinaryTreeToLinkedList.cpp		FlattenBinaryTreeToLinkedList.cpp
FrogJump.cpp		FrogJump.cpp
Game24.cpp		Game24.cpp
GenerateParentheses.cpp		GenerateParentheses.cpp
GrayCode.cpp		GrayCode.cpp
GroupAnagrams.cpp		GroupAnagrams.cpp
HouseRobber.cpp		HouseRobber.cpp
HouseRobber2.cpp		HouseRobber2.cpp
HouseRobber3.cpp		HouseRobber3.cpp
ImageSmoother.cpp		ImageSmoother.cpp
ImplementMagicDictionary.cpp		ImplementMagicDictionary.cpp
ImplementTrie.cpp		ImplementTrie.cpp
ImplementstrStr.cpp		ImplementstrStr.cpp
IntegerBreak.cpp		IntegerBreak.cpp
IntegerToRoman.cpp		IntegerToRoman.cpp
IsSubsequence.cpp		IsSubsequence.cpp
JumpGame.cpp		JumpGame.cpp
JumpGame2.cpp		JumpGame2.cpp
KthSmallestElementInABST.cpp		KthSmallestElementInABST.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

About

Releases

Packages

Languages

ssdemajia/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages