- 博客(38)
- 资源 (1)
- 收藏
- 关注
原创 LeetCode Integer to Roman
class Solution {public: string intToRoman(int num) { // Start typing your C/C++ solution below // DO NOT write int main() function map dict; dict[1] = "I";
2013-04-05 14:46:28 390
原创 LeetCode Insert Interval
/*** Definition for an interval.* struct Interval {* int start;* int end;* Interval() : start(0), end(0) {}* Interval(int s, int e) : start(s), end(e) {}* };*/class Solution {
2013-04-04 21:12:48 358
原创 LeetCode Implement strStr()
class Solution {public: char *strStr(char *haystack, char *needle) { // Start typing your C/C++ solution below // DO NOT write int main() function int len1 = strlen(haysta
2013-03-19 17:33:32 330
原创 LeetCode Gray Code
class Solution {public: vector grayCode(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int num = 1 << n; vector ans;
2013-03-17 18:30:29 343
原创 LeetCode Generate Parentheses
class Solution {public: vector generateParenthesis(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function string cur; vector ans;
2013-03-17 16:14:03 397
原创 LeetCode Flatten Binary Tree to Linked List
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-03-17 13:14:34 426
原创 LeetCode First Missing Positive
class Solution {public: int firstMissingPositive(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int i = 0;
2013-03-17 12:04:25 285
原创 LeetCode Edit Distance
class Solution {public: int minDistance(string word1, string word2) { // Start typing your C/C++ solution below // DO NOT write int main() function int len1 = word1.size()
2013-03-17 11:38:25 405
原创 LeetCode Divide Two Integers
class Solution {public: int divide(int dividend, int divisor) { // Start typing your C/C++ solution below // DO NOT write int main() function long long a = abs((long
2013-03-14 19:49:50 444
原创 LeetCode Distinct Subsequences
class Solution {public: int numDistinct(string S, string T) { // Start typing your C/C++ solution below // DO NOT write int main() function int s_len = S.size(); i
2013-03-13 14:19:16 455
原创 LeetCode Decode Ways
class Solution {public: int numDecodings(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function if (s.empty()) { return 0;
2013-03-10 19:31:27 391
原创 LeetCode Count and Say
class Solution {public: string countAndSay(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function string str = "1"; string temp;
2013-03-10 16:24:00 444
原创 LeetCode Convert Sorted List to Binary Search Tree
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *//** * Definition for binary tree * stru
2013-03-10 15:28:35 375
原创 LeetCode Convert Sorted Array to Binary Search Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-02-27 20:15:52 142
原创 LeetCode Container With Most Water
class Solution {public: int maxArea(vector &height) { // Start typing your C/C++ solution below // DO NOT write int main() function int start = 0; int end = height
2013-02-27 10:41:39 190
原创 LeetCode Construct Binary Tree from Inorder and Postorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-02-26 21:40:12 162
原创 LeetCode Construct Binary Tree from Preorder and Inorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-02-26 18:02:12 195
原创 LeetCode Combination Sum II
class Solution {public: vector > combinationSum2(vector &num, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function ans.clear();
2013-02-05 19:57:35 187
原创 LeetCode Combination Sum
class Solution {public: vector > combinationSum(vector &candidates, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function ans.clear()
2013-02-04 21:29:28 165
原创 LeetCode Combinations
class Solution {public: vector > combine(int n, int k) { // Start typing your C/C++ solution below // DO NOT write int main() function ans.clear(); vector
2013-02-03 18:47:21 213
原创 LeetCode Climbing Stairs
class Solution {public: int climbStairs(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 1) { return 1;
2013-01-16 23:42:45 132
原创 LeetCode Binary Tree Zigzag Level Order Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-15 22:50:14 152
原创 LeetCode Binary Tree Maximum Path Sum
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-15 21:56:17 232
原创 LeetCode Binary Tree Level Order Traversal II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-13 16:48:00 199
原创 LeetCode Binary Tree Level Order Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-13 16:36:56 179
原创 LeetCode Binary Tree Preorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-11 21:48:43 180
原创 LeetCode Binary Tree Postorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-11 21:02:07 226
原创 LeetCode Binary Tree Inorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-10 23:17:25 153
原创 LeetCode Best Time to Buy and Sell Stock III
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int profit = 0; int len = pri
2013-01-05 22:52:25 180
原创 LeetCode Best Time to Buy and Sell Stock II
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int profit = 0; int len = pri
2013-01-02 13:20:45 219
原创 LeetCode Best Time to Buy and Sell Stock
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int profit = 0; int len = pri
2013-01-01 19:39:12 168
原创 LeetCode Balanced Binary Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti
2013-01-01 14:45:14 174
原创 LeetCode Anagrams
class Solution {public: vector anagrams(vector &strs) { // Start typing your C/C++ solution below // DO NOT write int main() function vector anagrams; int
2012-12-31 18:05:12 178
原创 LeetCode Add Two Numbers
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ad
2012-12-30 22:55:51 167
原创 LeetCode Add Binary
class Solution {public: string addBinary(string a, string b) { // Start typing your C/C++ solution below // DO NOT write int main() function string str; i
2012-12-30 21:16:56 155
原创 LeetCode 4Sum
class Solution {public: vector > fourSum(vector &num, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > quadruplet;
2012-12-29 22:37:53 174
原创 LeetCode 3Sum
class Solution {public: vector > threeSum(vector &num) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > triplet; int len =
2012-12-29 22:14:36 252
原创 LeetCode 3Sum Closest
class Solution {public: int threeSumClosest(vector &num, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function sort(num.begin(), num.
2012-12-29 22:09:56 198
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人