LeetCode
lyangpku
这个作者很懒,什么都没留下…
展开
-
[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 m = T.size(); int n原创 2013-01-23 16:32:38 · 634 阅读 · 0 评论 -
[LeetCode] Populating Next Right Pointers in Each Node II
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL)原创 2013-01-23 15:11:46 · 293 阅读 · 0 评论 -
[LeetCode] Populating Next Right Pointers in Each Node
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL)原创 2013-01-23 14:36:58 · 301 阅读 · 0 评论 -
[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-01-24 14:52:36 · 411 阅读 · 0 评论 -
[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-01-24 15:43:07 · 397 阅读 · 0 评论 -
[LeetCode] Maximum Depth of 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-24 15:46:22 · 349 阅读 · 0 评论 -
[LeetCode] Validate 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-01-24 18:21:25 · 380 阅读 · 0 评论 -
[LeetCode] Interleaving String
class Solution {public: bool isInterleave(string s1, string s2, string s3) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = s1.s原创 2013-01-24 18:35:36 · 387 阅读 · 0 评论 -
[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-01-24 14:56:37 · 318 阅读 · 0 评论 -
[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-24 15:05:04 · 326 阅读 · 0 评论 -
[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-01-24 15:36:11 · 389 阅读 · 0 评论 -
[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-24 15:52:32 · 367 阅读 · 0 评论 -
[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-24 15:57:16 · 325 阅读 · 0 评论 -
[LeetCode] Symmetric Tree - Iteratively
/** * 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-24 16:38:22 · 1009 阅读 · 0 评论 -
[LeetCode] Binary Tree Inorder Traversal - Iteratively
/** * 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-24 19:05:51 · 420 阅读 · 0 评论 -
[LeetCode] Reverse Linked List II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *re原创 2013-01-24 19:23:47 · 384 阅读 · 0 评论 -
[LeetCode] Partition List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *pa原创 2013-01-24 20:39:18 · 328 阅读 · 0 评论 -
[LeetCode] Largest Rectangle in Histogram
class Solution {public: int largestRectangleArea(vector &height) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = height.size();原创 2013-01-25 02:02:25 · 409 阅读 · 0 评论 -
[LeetCode] Maximal Rectangle
class Solution {public: int f(vector &v) { int n = v.size(); vector left(n); vector right(n); for (int i = 0; i < n; i++) { left[i] =原创 2013-01-25 02:14:25 · 335 阅读 · 0 评论 -
[LeetCode] 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-24 03:13:34 · 423 阅读 · 0 评论 -
[LeetCode] Path Sum 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-24 03:20:29 · 457 阅读 · 0 评论 -
[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-24 03:43:57 · 433 阅读 · 0 评论 -
[LeetCode] Recover 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-01-24 18:17:19 · 639 阅读 · 0 评论 -
[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-01-24 03:08:10 · 685 阅读 · 0 评论 -
[LeetCode] Minimum Depth of Binary Tree - BFS
/** * 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-24 03:34:44 · 544 阅读 · 0 评论 -
[LeetCode] Minimum Depth of Binary Tree - DFS
/** * 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-24 03:37:19 · 456 阅读 · 0 评论 -
[LeetCode] Symmetric Tree - Recursively
/** * 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-24 16:11:28 · 454 阅读 · 0 评论 -
[LeetCode] Same 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-24 18:04:25 · 384 阅读 · 0 评论 -
[LeetCode] Unique Binary Search Tree
class Solution {public: int numTrees(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector dp(n + 1); dp[原创 2013-01-24 18:47:20 · 354 阅读 · 0 评论 -
[LeetCode] Merge Sorted Array
class Solution {public: void merge(int A[], int m, int B[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0) return;原创 2013-01-24 20:22:02 · 348 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted List II
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *de原创 2013-01-25 02:39:23 · 390 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *de原创 2013-01-25 02:42:52 · 392 阅读 · 0 评论 -
[LeetCode] Search in Rotated Sorted Array II
class Solution {public: bool search(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function for (int i = 0; i < n; i++)原创 2013-01-25 02:48:00 · 449 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted Array II
class Solution {public: int removeDuplicates(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n <= 2) return n;原创 2013-01-25 02:57:20 · 366 阅读 · 0 评论 -
[LeetCode] Word Search
class Solution {public: bool DFS(vector > &board, vector > &visited, string word, int i, int j, int n) { if (n == word.size()) return true; if (i = board.size()) return false;原创 2013-01-26 14:46:00 · 506 阅读 · 0 评论 -
[LeetCode] Combinations
class Solution {public: vector > ret; vector sln; void DFS(int n, int k, int m) { if (k == 0) { ret.push_back(sln); return; }原创 2013-01-26 15:00:25 · 530 阅读 · 0 评论 -
[LeetCode] Subsets II
class Solution {public: vector > ret; vector sln; void DFS(vector &S, int n) { if (S.size() == n) { ret.push_back(sln); return; }原创 2013-01-24 19:44:30 · 513 阅读 · 0 评论 -
[LeetCode] Subsets
class Solution {public: vector > ret; vector sln; void DFS(vector &S, int n) { if (n == S.size()) { ret.push_back(sln); return; }原创 2013-01-26 14:50:59 · 1141 阅读 · 0 评论 -
[LeetCode] Search a 2D Matrix
class Solution {public: bool searchMatrix(vector > &matrix, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = matrix.size原创 2013-01-26 15:37:23 · 512 阅读 · 0 评论 -
[LeetCode] Set Matrix Zeroes
class Solution {public: void setZeroes(vector > &matrix) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = matrix.size(); if原创 2013-01-26 15:47:57 · 339 阅读 · 0 评论