星辰大海

Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the l

Path Sum  Total Accepted: 31405 Total Submissions: 104326My Submissions Question  Solution  Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that add

leetcode-Minimum Depth of Binary Tree

leetcode-Binary Tree Level Order Traversal 二叉树层序遍历 #include #include using namespace std; typedef struct BiTree { int val; struct BiTree *lchild; struct BiTree *rchild; }BiTree; void main(

Set Matrix Zeroes Total Accepted: 25064 Total Submissions: 80609 My Submissions Question Solution  Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. c

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *g

Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. class Solution { private: TreeNode *root; v

For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. 全排列： 从1开始递归，然后对2递归，最后对3递归     顺序是先输出 1 2 3  1 3 2  2 1 3   2  3 1 .......