leetcode

My leetcode solutions, all implemented by C.

我最擅长的语言是Java，以前只是拿C做驱动开发，并不怎么熟。

这里用C来做leetcode一是想把C用熟一点，二是C不像Java有很多成熟的算法和数据结构，很多需要自己实现，顺道学习算法。

通过做这些题确实对常用的排序算法、hashtable、红黑树等算法和数据结构有了比较好的认识，受益匪浅。

但毕竟C功力有限，如果有不对的地方或者算法上可以优化的地方，欢迎指正交流。

Contact me : zhfchdev@gmail.com

Name		Name	Last commit message	Last commit date
Latest commit History 19 Commits
.gitignore		.gitignore
001-Two Sum.c		001-Two Sum.c
002-Add Two Numbers.c		002-Add Two Numbers.c
003-Longest Substring Without Repeating Characters.c		003-Longest Substring Without Repeating Characters.c
005-Longest Palindromic Substring.c		005-Longest Palindromic Substring.c
006-ZigZag Conversion.c		006-ZigZag Conversion.c
007-Reverse Integer.c		007-Reverse Integer.c
008-String to Integer (atoi).c		008-String to Integer (atoi).c
009-Palindrome Number.c		009-Palindrome Number.c
011-Container With Most Water.c		011-Container With Most Water.c
012-Integer to Roman.c		012-Integer to Roman.c
013-Roman to Integer.c		013-Roman to Integer.c
014-Longest Common Prefix.c		014-Longest Common Prefix.c
015-3Sum.c		015-3Sum.c
016-3Sum Closest.c		016-3Sum Closest.c
017-Letter Combinations of a Phone Number.c		017-Letter Combinations of a Phone Number.c
018-4Sum.c		018-4Sum.c
019-Remove Nth Node From End of List.c		019-Remove Nth Node From End of List.c
020-Valid Parentheses.c		020-Valid Parentheses.c
021-Merge Two Sorted Lists.c		021-Merge Two Sorted Lists.c
022-Generate Parentheses.c		022-Generate Parentheses.c
023-Merge k Sorted Lists.c		023-Merge k Sorted Lists.c
024-Swap Nodes in Pairs.c		024-Swap Nodes in Pairs.c
025-Reverse Nodes in k-Group.c		025-Reverse Nodes in k-Group.c
026-Remove Duplicates from Sorted Array.c		026-Remove Duplicates from Sorted Array.c
027-Remove Element.c		027-Remove Element.c
028-Implement strStr().c		028-Implement strStr().c
029-Divide Two Integers.c		029-Divide Two Integers.c
030-Substring with Concatenation of All Words.c		030-Substring with Concatenation of All Words.c
031-Next Permutation.c		031-Next Permutation.c
032-Longest Valid Parentheses.c		032-Longest Valid Parentheses.c
033-Search in Rotated Sorted Array.c		033-Search in Rotated Sorted Array.c
034-Search for a Range.c		034-Search for a Range.c
035-Search Insert Position.c		035-Search Insert Position.c
036-Valid Sudoku.c		036-Valid Sudoku.c
038-Count and Say.c		038-Count and Say.c
039-Combination Sum.c		039-Combination Sum.c
040-Combination Sum II.c		040-Combination Sum II.c
041-First Missing Positive.c		041-First Missing Positive.c
042-Trapping Rain Water.c		042-Trapping Rain Water.c
043-Multiply Strings.c		043-Multiply Strings.c
044-Wildcard Matching.c		044-Wildcard Matching.c
045-Jump Game II.c		045-Jump Game II.c
046-Permutations.c		046-Permutations.c
047-Permutations II.c		047-Permutations II.c
048-Rotate Image.c		048-Rotate Image.c
049-Anagrams.c		049-Anagrams.c
050-Pow(x, n).c		050-Pow(x, n).c
051-N-Queens.c		051-N-Queens.c
052-N-Queens II.c		052-N-Queens II.c
053-Maximum Subarray.c		053-Maximum Subarray.c
054-Spiral Matrix.c		054-Spiral Matrix.c
055-Jump Game.c		055-Jump Game.c
056-Merge Intervals.c		056-Merge Intervals.c
057-Insert Interval.c		057-Insert Interval.c
058-Length of Last Word.c		058-Length of Last Word.c
059-Spiral Matrix II.c		059-Spiral Matrix II.c
060-Permutation Sequence.c		060-Permutation Sequence.c
061-Rotate List.c		061-Rotate List.c
062-Unique Paths.c		062-Unique Paths.c
063-Unique Paths II.c		063-Unique Paths II.c
064-Minimum Path Sum.c		064-Minimum Path Sum.c
066-Plus One.c		066-Plus One.c
067-Add Binary.c		067-Add Binary.c
069-Sqrt(x).c		069-Sqrt(x).c
070-Climbing Stairs.c		070-Climbing Stairs.c
071-Simplify Path.c		071-Simplify Path.c
072-Edit Distance.c		072-Edit Distance.c
073-Set Matrix Zeroes.c		073-Set Matrix Zeroes.c
074-Search a 2D Matrix.c		074-Search a 2D Matrix.c
075-Sort Colors.c		075-Sort Colors.c
076-Minimum Window Substring.c		076-Minimum Window Substring.c
077-Combinations.c		077-Combinations.c
078-Subsets.c		078-Subsets.c
079-Word Search.c		079-Word Search.c
080-Remove Duplicates from Sorted Array II.c		080-Remove Duplicates from Sorted Array II.c
081-Search in Rotated Sorted Array II.c		081-Search in Rotated Sorted Array II.c
082-Remove Duplicates from Sorted List II.c		082-Remove Duplicates from Sorted List II.c
083-Remove Duplicates from Sorted List.c		083-Remove Duplicates from Sorted List.c
084-Largest Rectangle in Histogram.c		084-Largest Rectangle in Histogram.c
086-Partition List.c		086-Partition List.c
087-Scramble String.c		087-Scramble String.c
088-Merge Sorted Array.c		088-Merge Sorted Array.c
089-Gray Code.c		089-Gray Code.c
090-Subsets II.c		090-Subsets II.c
091-Decode Ways.c		091-Decode Ways.c
092-Reverse Linked List II.c		092-Reverse Linked List II.c
093-Restore IP Addresses.c		093-Restore IP Addresses.c
094-Binary Tree Inorder Traversal.c		094-Binary Tree Inorder Traversal.c
095-Unique Binary Search Trees II.c		095-Unique Binary Search Trees II.c
096-Unique Binary Search Trees.c		096-Unique Binary Search Trees.c
097-Interleaving String.c		097-Interleaving String.c
098-Validate Binary Search Tree.c		098-Validate Binary Search Tree.c
099-Recover Binary Search Tree.c		099-Recover Binary Search Tree.c
100-Same Tree.c		100-Same Tree.c
101-Symmetric Tree.c		101-Symmetric Tree.c
102-Binary Tree Level Order Traversal.c		102-Binary Tree Level Order Traversal.c
103-Binary Tree Zigzag Level Order Traversal.c		103-Binary Tree Zigzag Level Order Traversal.c
104-Maximum Depth of Binary Tree.c		104-Maximum Depth of Binary Tree.c
105-Construct Binary Tree from Preorder and Inorder Traversal.c		105-Construct Binary Tree from Preorder and Inorder Traversal.c

komea/leetcode

Folders and files

Latest commit

History