LeetCode
金刚哥葫芦娃
这个作者很懒,什么都没留下…
展开
-
【LeetCode】62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bott...原创 2018-06-05 15:25:53 · 93 阅读 · 0 评论 -
【LeetCode】77. Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.Example:Input: n = 4, k = 2Output:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]问题描述看样例就很清楚:给定k和n,...原创 2018-06-20 08:35:19 · 140 阅读 · 0 评论 -
【LeetCode】78. Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [3], [1], [2...原创 2018-06-20 09:39:20 · 107 阅读 · 0 评论 -
【LeetCode】82. Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Example 1:Input: 1->2->3->3->4->4->5Output: 1->2-&g...原创 2018-07-02 21:46:21 · 105 阅读 · 0 评论 -
【LeetCode】86. Partition List
Given 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 of the...原创 2018-07-03 12:08:19 · 127 阅读 · 0 评论 -
【LeetCode】81. Search in Rotated Sorted Array II
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).You are given a target value to search. If found in t...原创 2018-06-28 10:01:50 · 117 阅读 · 0 评论 -
【LeetCode】93. Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.Example:Given a string containing only digits, restore it by returning all possible valid...原创 2018-07-30 20:30:35 · 132 阅读 · 0 评论 -
【LeetCode】89. Gray Code
The 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 of gr...原创 2018-07-30 20:40:25 · 99 阅读 · 0 评论 -
【LeetCode】80. Remove Duplicates from Sorted Array II
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.Do not allocate extra space for another array, you must do this by modif...原创 2018-06-26 10:40:36 · 96 阅读 · 0 评论 -
【LeetCode】79. Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically nei...原创 2018-06-26 10:25:06 · 107 阅读 · 0 评论 -
【LeetCode】56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals.Example 1:Input: [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps, mer...原创 2018-05-30 14:54:00 · 135 阅读 · 0 评论 -
【LeetCode】59. Spiral Matrix II
Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.Example:Input: 3Output:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ]]输入数字n,然后按照螺旋形从1开始输出一个n*n矩阵。这...原创 2018-05-31 09:52:01 · 172 阅读 · 0 评论 -
【LeetCode】61. Rotate List
Given a linked list, rotate the list to the right by k places, where k is non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2->3->NULLExplanation...原创 2018-06-07 20:44:55 · 104 阅读 · 0 评论 -
【LeetCode】63. Unique Paths II
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bott...原创 2018-06-09 20:43:32 · 121 阅读 · 0 评论 -
【LeetCode】64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any...原创 2018-06-10 17:28:37 · 114 阅读 · 0 评论 -
【LeetCode】73. Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.Example 1:Input: [ [1,1,1], [1,0,1], [1,1,1]]Output: [ [1,0,1], [0,0,0], [1,0,1]]Example ...原创 2018-06-19 11:15:01 · 119 阅读 · 0 评论 -
【LeetCode】74. Search a 2D Matrix
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 from left to right.The first integer of each row is ...原创 2018-06-19 11:17:44 · 104 阅读 · 0 评论 -
【LeetCode】75. Sort Colors
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the inte...原创 2018-06-19 11:21:59 · 116 阅读 · 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. The ...原创 2018-08-04 20:04:52 · 132 阅读 · 0 评论 -
【LeetCode】100. Same Tree
Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example ...原创 2018-08-04 20:13:33 · 134 阅读 · 0 评论 -
【LeetCode】90. Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: [1,2,2]...原创 2018-07-31 21:08:20 · 109 阅读 · 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.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the...原创 2018-09-09 08:49:49 · 135 阅读 · 0 评论 -
【LeetCode】106. Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, giveninorder = [9,3,15,20,7]postorder = [9...原创 2018-09-06 09:34:42 · 174 阅读 · 0 评论 -
【LeetCode】109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the ...原创 2018-10-12 20:09:51 · 140 阅读 · 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...原创 2018-10-13 09:54:42 · 133 阅读 · 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.Note: A leaf is a node with no childre...原创 2018-10-13 10:05:04 · 146 阅读 · 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.Note: A leaf is a node with no children.Example:...原创 2018-10-13 10:09:53 · 155 阅读 · 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.Note: A leaf is a node with no children.Example:Given the below binary tree and sum = 22,...原创 2018-10-16 09:32:57 · 245 阅读 · 0 评论 -
【LeetCode】114. Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example, given the following tree: 1 / \ 2 5 / \ \3 4 6The flattened tree should look like:1 \ 2 \ 3...原创 2018-11-12 08:53:42 · 243 阅读 · 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,null,null,15,7...原创 2018-09-08 22:08:25 · 134 阅读 · 0 评论 -
【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, givenpreorder = [3,9,20,15,7]inorder = [9,3...原创 2018-09-05 15:16:09 · 164 阅读 · 0 评论 -
【LeetCode】91. Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given a non-empty string containing only digits, determine th...原创 2018-07-31 21:28:13 · 118 阅读 · 0 评论 -
【LeetCode】92. Reverse Linked List II
Reverse a linked list from position m to n. Do it in one-pass.Note: 1 ≤ m ≤ n ≤ length of list.Example:Input: 1->2->3->4->5->NULL, m = 2, n = 4Output: 1->4->3->2->5-...原创 2018-07-31 21:33:53 · 143 阅读 · 0 评论 -
【LeetCode】93. Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.Example:Input: "25525511135"Output: ["255.255.11.135", "255.255.111.35"]将一串字符转换成正确的IP...原创 2018-07-31 21:42:34 · 133 阅读 · 0 评论 -
【LeetCode】94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.Example:Input: [1,null,2,3] 1 \ 2 / 3Output: [1,3,2]Follow up: Recursive solution is trivial, could y...原创 2018-07-31 21:50:54 · 103 阅读 · 0 评论 -
【LeetCode】96. Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?Example:Input: 3Output: 5Explanation:Given n = 3, there are a total of 5 unique BST's: 1 ...原创 2018-07-31 22:06:29 · 304 阅读 · 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 [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B...原创 2018-08-06 14:48:36 · 142 阅读 · 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,null,null,15,7], 3 / \ 9 20 ...原创 2018-08-06 15:35:22 · 130 阅读 · 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 tre...原创 2018-08-17 09:47:57 · 149 阅读 · 0 评论 -
【LeetCode】116. Populating Next Right Pointers in Each Node
Given 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 right...原创 2018-12-10 15:33:24 · 291 阅读 · 0 评论