Leetcode
zhangwj0101
记忆力越来越不好,总结总结放到这,今后方便查看
展开
-
Leetcode 85. Maximal Rectangle
QuestionGiven a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing all ones and return its area.Code public int maximalRectangle(char[][] matrix) { if (matrix == nu原创 2016-04-10 21:10:11 · 319 阅读 · 0 评论 -
Leetcode 118. Pascal's Triangle
###QuestionGiven numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]Code public List<List<I原创 2016-03-25 16:14:15 · 202 阅读 · 0 评论 -
Leetcode 124. Binary Tree Maximum Path Sum
QuestionGiven a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. T原创 2016-03-25 10:19:23 · 574 阅读 · 0 评论 -
leetcode-120. Triangle
leetcode地址 分析: 对于这道题目开始理解错误,一直不知道如何解决,后来看了代码之后恍然大悟,其实很简单,直接通过DP就可以搞定。 从最后一行开始往上走,然后就可以解决问题。public class Solution { public int minimumTotal(List<List<Integer>> triangle) { if原创 2016-03-14 10:10:07 · 229 阅读 · 0 评论 -
Leetcode 126. Word Ladder II
QuestionGiven two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a time原创 2016-03-24 14:47:16 · 386 阅读 · 0 评论 -
Leetcode 128. Longest Consecutive Sequence
QuestionGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [1, 2原创 2016-03-24 12:37:48 · 186 阅读 · 0 评论 -
Leetcode 129. Sum Root to Leaf Numbers
QuestionGiven 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 s原创 2016-03-24 12:23:13 · 198 阅读 · 0 评论 -
leetcode 130. Surrounded Regions
QuestionGiven a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’.A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.For example, X X X X X O O X原创 2016-03-24 11:08:04 · 170 阅读 · 0 评论 -
Leetcode 125. Valid Palindrome
QuestionGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is not原创 2016-03-24 10:24:56 · 198 阅读 · 0 评论 -
Leetcode 86. Partition List
QuestionGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each原创 2016-04-06 13:38:53 · 520 阅读 · 0 评论 -
Leetcode 87. Scramble String
QuestionGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = “great”: great / \ gr原创 2016-04-06 13:31:44 · 295 阅读 · 0 评论 -
Leetcode 119. Pascal's Triangle II
QuestionGiven an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Code public List<Integer> getRow(int rowIndex) { List<Integer> results = new Ar原创 2016-03-25 11:05:50 · 183 阅读 · 0 评论 -
Leetcode 115. Distinct Subsequences
QuestionGiven a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be原创 2016-03-25 20:59:56 · 202 阅读 · 0 评论 -
Leetcode 116. Populating Next Right Pointers in Each Node
QuestionGiven a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its next right node. If there is no next rig原创 2016-03-25 21:29:04 · 225 阅读 · 0 评论 -
leetcode 84. Largest Rectangle in Histogram
QuestionGiven n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of e原创 2016-04-10 20:28:44 · 312 阅读 · 0 评论 -
Leetcode 110. Balanced Binary Tree
QuestionGiven 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 di原创 2016-03-28 21:42:05 · 236 阅读 · 0 评论 -
Leetcode 111. Minimum Depth of Binary Tree My Submissions QuestionEditorial Solution
QuestionGiven 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.Code队列的方式 /** * 队列的方式实现 *原创 2016-03-28 20:22:29 · 632 阅读 · 0 评论 -
leetcode 113. Path Sum II
QuestionGiven 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 / \原创 2016-03-28 20:10:35 · 247 阅读 · 0 评论 -
Leetcode 112. Path Sum
QuestionGiven 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原创 2016-03-28 20:09:20 · 173 阅读 · 0 评论 -
Leetcode 114. Flatten Binary Tree to Linked List
QuestionGiven 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 \原创 2016-03-28 20:01:23 · 170 阅读 · 0 评论 -
leetcode 123. Best Time to Buy and Sell Stock III
QuestionSay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Codepublic int m原创 2016-03-25 21:51:23 · 177 阅读 · 0 评论 -
Leetcode 122. Best Time to Buy and Sell Stock II
QuestionSay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy原创 2016-03-25 21:49:22 · 170 阅读 · 0 评论 -
Leetcode 121. Best Time to Buy and Sell Stock
questionSay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stoc原创 2016-03-25 21:46:54 · 187 阅读 · 0 评论 -
Leetcode 117. Populating Next Right Pointers in Each Node II
QuestionFollow up for problem “Populating Next Right Pointers in Each Node”.What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant extra原创 2016-03-25 21:37:27 · 254 阅读 · 0 评论 -
Leetcode 89. Gray Code
QuestionThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence原创 2016-04-06 10:37:14 · 432 阅读 · 0 评论 -
Leetcode 5. Longest Palindromic Substring
QuestionGiven a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.code常规方式/* 常原创 2016-03-24 08:56:55 · 295 阅读 · 0 评论 -
Leetcode 132. Palindrome Partitioning II
Question Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s =原创 2016-03-24 08:19:24 · 370 阅读 · 0 评论 -
Leetcode 102. Binary Tree Level Order Traversal
QuestionGiven 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 20 /原创 2016-03-29 14:57:32 · 242 阅读 · 0 评论 -
Leetcode 103. Binary Tree Zigzag Level Order Traversal
QuestionGiven 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 bina原创 2016-03-29 14:56:08 · 345 阅读 · 0 评论 -
Leetcode 104. Maximum Depth of Binary Tree
QuestionGiven 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.Code递归方式 /** * 递归的方式 *原创 2016-03-29 14:53:38 · 391 阅读 · 0 评论 -
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
QuestionGiven preorder and inorder traversal of a tree, construct the binary tree.Code public TreeNode get(int[] preorder, int[] inorder, int i, int ileft, int iright) { if (ileft > iright) {原创 2016-03-29 14:44:56 · 233 阅读 · 0 评论 -
Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal
QuestonGiven inorder and postorder traversal of a tree, construct the binary tree.Code public TreeNode get(int[] inorder, int[] postorder, int i, int ileft, int iright) { if (ileft > iright) {原创 2016-03-29 14:40:49 · 229 阅读 · 0 评论 -
Leetcode 107. Binary Tree Level Order Traversal II
QuestionGiven 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原创 2016-03-29 14:30:42 · 262 阅读 · 0 评论 -
Leetcode 108. Convert Sorted Array to Binary Search Tree
QuestionGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.Code public TreeNode build(int[] nums, int left, int right) { if (left <= right) {原创 2016-03-29 14:26:46 · 254 阅读 · 0 评论 -
Leetcode 109. Convert Sorted List to Binary Search Tree
QuestionGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Codepublic TreeNode build(List<Integer> nums, int left, int right) { if (lef原创 2016-03-29 14:25:24 · 399 阅读 · 0 评论 -
Leetcode 28. Implement strStr()
QuestionImplement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Code public int strStr(String haystack, String needle) { if (h原创 2016-03-29 14:14:06 · 181 阅读 · 0 评论 -
Leetcode-97 Interleaving String
Leetcode-97 Interleaving StringquestionGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = “aabcc”, s2 = “dbbca”,When s3 = “aadbbcbcac”, return true原创 2016-03-16 10:14:16 · 231 阅读 · 0 评论 -
Leetcode 101. Symmetric Tree
QuestionGiven 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 following原创 2016-03-29 15:00:16 · 204 阅读 · 0 评论 -
Leetcode 100. Same Tree
QuestionGiven 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.Code public原创 2016-03-29 15:02:42 · 224 阅读 · 0 评论 -
Leetcode 72. Edit Distance
QuestionGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a wo原创 2016-03-31 21:46:31 · 420 阅读 · 0 评论