Leetcode (C++) - 随笔分类(第6页) - joannae

54. Spiral Matrix (Graph)

摘要：Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example,Given the following matrix:[ [ 1,... 阅读全文

posted @ 2015-10-04 15:56 joannae 阅读(194) 评论(0) 推荐(0)

74. Search a 2D Matrix (Graph; Divide-and-Conquer)

摘要：Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted f 阅读全文

posted @ 2015-10-04 15:51 joannae 阅读(166) 评论(0) 推荐(0)

48. Rotate Image (Array)

摘要：You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 阅读全文

posted @ 2015-10-04 15:46 joannae 阅读(133) 评论(0) 推荐(0)

119. Pascal's Triangle II (Graph; WFS)

摘要：Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use... 阅读全文

posted @ 2015-10-04 15:43 joannae 阅读(143) 评论(0) 推荐(0)

118. Pascal's Triangle (Array)

摘要：Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return 阅读全文

posted @ 2015-10-04 15:27 joannae 阅读(192) 评论(0) 推荐(0)

127. Word Ladder (Tree, Queue; WFS)

摘要：Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文

posted @ 2015-10-04 15:21 joannae 阅读(370) 评论(0) 推荐(0)

117. Populating Next Right Pointers in Each Node II (Tree; WFS)

摘要：Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文

posted @ 2015-10-04 14:58 joannae 阅读(172) 评论(0) 推荐(0)

116. Populating Next Right Pointers in Each Node (Tree; WFS)

摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文

posted @ 2015-10-04 14:54 joannae 阅读(183) 评论(0) 推荐(0)

107. Binary Tree Level Order Traversal II(Tree, WFS)

摘要：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 ... 阅读全文

posted @ 2015-10-04 14:49 joannae 阅读(174) 评论(0) 推荐(0)

106. Construct Binary Tree from Inorder and Postorder Traversal (Tree; DFS)

摘要：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.struct TreeNod... 阅读全文

posted @ 2015-10-04 14:33 joannae 阅读(157) 评论(0) 推荐(0)

105. Construct Binary Tree from Preorder and Inorder Traversal (Tree; DFS)

摘要：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 ... 阅读全文

posted @ 2015-10-04 14:24 joannae 阅读(152) 评论(0) 推荐(0)

101. Symmetric Tree (Tree, Queue; DFS, WFS)

摘要：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 / 阅读全文

posted @ 2015-10-04 14:11 joannae 阅读(311) 评论(0) 推荐(0)

95. Unique Binary Search Trees II (Tree; DFS)

摘要：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 al 阅读全文

posted @ 2015-10-04 12:22 joannae 阅读(293) 评论(0) 推荐(0)

96. Unique Binary Search Trees (Tree; DP)

摘要：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 阅读全文

posted @ 2015-10-04 11:49 joannae 阅读(217) 评论(0) 推荐(0)

110. Balanced Binary Tree (Tree; DFS)

摘要：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... 阅读全文

posted @ 2015-10-04 11:38 joannae 阅读(159) 评论(0) 推荐(0)

104. Maximum Depth of Binary Tree (Tree; DFS)

摘要：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 le... 阅读全文

posted @ 2015-10-04 11:35 joannae 阅读(187) 评论(0) 推荐(0)

111. Minimum Depth of Binary Tree (Tree; DFS)

摘要：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 le... 阅读全文

posted @ 2015-10-04 11:34 joannae 阅读(219) 评论(0) 推荐(0)

124. Binary Tree Maximum Path Sum (Tree; DFS)

摘要：Given 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 th 阅读全文

posted @ 2015-10-04 11:17 joannae 阅读(229) 评论(0) 推荐(0)

99. Recover Binary Search Tree (Tree; DFS)

摘要：Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n) space 阅读全文

posted @ 2015-10-04 10:35 joannae 阅读(183) 评论(0) 推荐(0)

129. Sum Root to Leaf Numbers(Tree; DFS)

摘要：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... 阅读全文

posted @ 2015-10-04 10:22 joannae 阅读(161) 评论(0) 推荐(0)

随笔分类 - Leetcode (C++)