LeetCode
祭夏--
这个作者很懒,什么都没留下…
展开
-
Leetcode_217 Contains Duplicate
Leetcode_217 Contains Duplicate Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it shoul原创 2015-05-14 16:35:09 · 322 阅读 · 0 评论 -
LeetCode_114 Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like 1 \ 2 \原创 2015-07-29 11:20:40 · 255 阅读 · 0 评论 -
Leetcode_100 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. public bo原创 2015-07-15 14:03:15 · 243 阅读 · 0 评论 -
LeetCode_101 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 3 B原创 2015-07-15 14:43:55 · 327 阅读 · 0 评论 -
LeetCode_235 Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two原创 2015-07-29 15:48:35 · 272 阅读 · 0 评论 -
LeetCode_129 Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total sum of al原创 2015-07-29 16:09:46 · 359 阅读 · 0 评论 -
LeetCode_230 Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements. Follow up: What i原创 2015-07-29 16:33:55 · 301 阅读 · 0 评论 -
LeetCode_222 Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely fill原创 2015-07-29 17:36:02 · 339 阅读 · 0 评论 -
LeetCode_124 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.如果这个作为root,那么最长路应该就是F(left) + F(ri原创 2015-07-30 11:33:51 · 301 阅读 · 0 评论 -
LeetCode_145 Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. private void resPreorder(TreeNode原创 2015-07-30 18:16:19 · 293 阅读 · 0 评论 -
LeetCode_199 Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the following binary tree, 1原创 2015-07-30 18:19:01 · 302 阅读 · 0 评论 -
Leetcode_226 Invert Binary Tree
Invert a binary tree. 4/ \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max Howell: Go原创 2015-07-30 18:22:24 · 278 阅读 · 0 评论 -
LeetCode_144 Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3].List<Integer> result = new ArrayList原创 2015-07-30 18:13:32 · 351 阅读 · 0 评论 -
LeetCode_237 Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with valu原创 2015-07-31 11:31:49 · 307 阅读 · 0 评论 -
LeetCode_234 Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space?public boolean isPalindrome(ListNode head) { if(head == null || h原创 2015-08-03 14:10:29 · 286 阅读 · 0 评论 -
LeetCode_206 Reverse Linked List
Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both?pre始终是首元结点的值,每次对pnext重新赋值 递归 public ListNode reverseList(ListNode原创 2015-08-03 11:34:08 · 329 阅读 · 0 评论 -
LeetCode_112 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原创 2015-07-28 20:56:25 · 280 阅读 · 0 评论 -
LeetCode_111 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.public int minDepth(TreeNode root) {原创 2015-07-28 17:48:03 · 252 阅读 · 0 评论 -
Leetcode_219 Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.原创 2015-06-11 17:51:09 · 304 阅读 · 0 评论 -
Leetcode_220 Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is原创 2015-06-15 11:42:20 · 331 阅读 · 0 评论 -
LeetCode_105 Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. public TreeNode buildTree(int[] preorder, int[] inorder) { int size = inorder.length; if(size ==原创 2015-07-27 18:07:17 · 283 阅读 · 0 评论 -
Leetcode_94 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 / 3 return [1,3,2]. Note: Recursive原创 2015-07-14 14:28:42 · 322 阅读 · 0 评论 -
LeetCode_96 Unique Binary Search Trees
Given n, how many structurally unique BST’s (binary search trees) that store values 1…n? For example, Given n = 3, there are a total of 5 unique BST’s. 1 3 3 2 1原创 2015-07-14 15:30:01 · 254 阅读 · 0 评论 -
Leetcode_98 Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node’s key.原创 2015-07-15 10:52:55 · 255 阅读 · 0 评论 -
Leetcode_95 Unique Binary Search Trees II
Given n, generate all structurally unique BST’s (binary search trees) that store values 1…n. For example, Given n = 3, your program should return all 5 unique BST’s shown below. 1 3原创 2015-07-14 17:05:42 · 246 阅读 · 0 评论 -
LeetCode_107 Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Given binary tree {3,9,20,#,#,15,7},原创 2015-07-28 10:28:11 · 267 阅读 · 0 评论 -
LeetCode_106 Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.public TreeNode buildTree(int[] inorder, int[] postorder) { int size = inorder.length; if(size ==0) return原创 2015-07-28 10:03:50 · 271 阅读 · 0 评论 -
LeetCode_108 Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.高度平衡是指左右子树的高度最大相差1,二分检索树是,根节点的左子树的所有节点值都小于等于根节点,右子树的所有节点值都大于等于根节点,左右子树也是二分搜索树。 public TreeNode sort原创 2015-07-28 11:40:03 · 233 阅读 · 0 评论 -
LeetCode_113 Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example: Given the below binary tree and sum = 22, 5原创 2015-07-28 21:52:10 · 186 阅读 · 0 评论 -
LeetCode_102 Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9原创 2015-07-15 16:56:26 · 256 阅读 · 0 评论 -
LeetCode_103 Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary原创 2015-07-15 21:28:12 · 242 阅读 · 0 评论 -
LeetCode_104 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.可以采用递归,DFS public int maxDepth(T原创 2015-07-15 17:42:40 · 259 阅读 · 0 评论 -
LeetCode_110 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 of every node never diff原创 2015-07-28 17:12:47 · 301 阅读 · 0 评论 -
LeetCode_3 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. For “原创 2015-08-03 15:48:24 · 424 阅读 · 0 评论