LeetCode
文章平均质量分 63
__xiaoxiao__
这个作者很懒,什么都没留下…
展开
-
Remove Nth Node From End of List
代码有点乱,等有空再改。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原创 2013-09-05 23:42:57 · 386 阅读 · 0 评论 -
Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2013-09-16 17:13:06 · 567 阅读 · 0 评论 -
Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. TreeNode *sortedArrayToBST(vector &num) { if (num.size() == 0) re原创 2013-09-15 23:37:01 · 529 阅读 · 0 评论 -
Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofevery node never diff原创 2013-09-15 23:15:36 · 623 阅读 · 0 评论 -
Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]. vector inorde原创 2013-09-13 18:11:37 · 345 阅读 · 0 评论 -
Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and原创 2013-09-02 15:55:37 · 361 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.原创 2013-09-09 23:07:37 · 487 阅读 · 0 评论 -
Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2013-09-09 11:45:33 · 445 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2013-09-09 10:42:25 · 473 阅读 · 0 评论 -
Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. int minDepth(TreeNode *roo原创 2013-09-01 23:41:12 · 539 阅读 · 0 评论 -
Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value./** *原创 2013-09-01 20:45:38 · 419 阅读 · 0 评论 -
Pow(double x, int n)
Implement pow(x, n). double pow(double x, int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0) retur原创 2013-09-01 20:29:17 · 700 阅读 · 0 评论 -
Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. int maxDepth(TreeNode *root)原创 2013-09-05 22:14:51 · 410 阅读 · 0 评论