递归
文章平均质量分 62
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
44. Wildcard Matching
Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t原创 2016-11-17 16:57:04 · 332 阅读 · 0 评论 -
1406. Stone Game III
Alice and Bob continue theirgames with piles of stones. There are several stonesarranged in a row, and each stone has an associatedvalue which is an integer given in the arraystoneValue.Alice an...原创 2020-04-07 22:00:18 · 200 阅读 · 0 评论 -
1373. Maximum Sum BST in Binary Tree
Given abinary treeroot, the task is to return the maximum sum of all keys ofanysub-tree which is also a Binary Search Tree (BST).Assume a BST is defined as follows:The left subtree of a node c...原创 2020-03-16 22:05:42 · 351 阅读 · 0 评论 -
1372. Longest ZigZag Path in a Binary Tree
Given a binary treeroot, aZigZag path for a binary tree is defined as follow:Chooseanynode in the binary tree and a direction (right or left). If the current direction is right then move to the...原创 2020-03-16 22:05:08 · 259 阅读 · 0 评论 -
1344. Jump Game V
Given an array ofintegersarrand an integerd. In one step you can jump from indexito index:i + xwhere:i + x < arr.lengthand0 <x <= d. i - xwhere:i - x >= 0and0 <x <...原创 2020-02-02 16:31:02 · 185 阅读 · 0 评论 -
1269. Number of Ways to Stay in the Same Place After Some Steps
You have a pointer at index0in an array of sizearrLen. At each step, you can move 1 position to the left, 1 position to the rightin the array or stay in the same place (The pointer should not be ...原创 2020-02-01 10:50:43 · 336 阅读 · 0 评论 -
1306. Jump Game III
Given an array of non-negative integersarr, you are initially positioned atstartindex of the array. When you are at indexi, you can jumptoi + arr[i]ori - arr[i], check if you can reach toany...原创 2020-01-30 22:08:56 · 229 阅读 · 0 评论 -
1325. Delete Leaves With a Given Value
Given a binary treerootand an integertarget, delete all theleaf nodeswith valuetarget.Notethat once you delete a leaf node with valuetarget,if it's parent node becomes a leaf node and has t...原创 2020-01-25 21:15:29 · 206 阅读 · 0 评论 -
1155. Number of Dice Rolls With Target Sum
You haveddice, and each die hasffaces numbered1, 2, ..., f.Return the number of possible ways (out offdtotal ways)modulo10^9 + 7to roll the dice so the sum of the face up numbers equalsta...原创 2019-08-11 12:34:11 · 381 阅读 · 0 评论 -
1140. Stone Game II
Alexand Lee continue theirgames with piles of stones. There are a number ofpilesarranged in a row, and each pile has a positive integer number of stonespiles[i]. The objective of the game is to...原创 2019-07-28 13:24:31 · 567 阅读 · 0 评论 -
1147. Longest Chunked Palindrome Decomposition
Return the largest possibleksuch that there existsa_1, a_2, ..., a_ksuch that:Eacha_iis a non-empty string; Their concatenationa_1 + a_2 + ... + a_kis equal totext; For all1 <= i <...原创 2019-08-04 12:03:41 · 303 阅读 · 0 评论 -
5131. Minimum Cost Tree From Leaf Values
Given an arrayarrof positive integers, consider all binary trees such that:Each node has either 0 or 2 children; The values ofarrcorrespond to the values of eachleafin an in-order traversal o...原创 2019-07-21 12:01:08 · 943 阅读 · 0 评论 -
1096. Brace Expansion II
Under a grammar given below, strings can represent a set of lowercase words. Let'suseR(expr)to denote thesetof words the expression represents.Grammar can best be understood through simple exa...原创 2019-06-23 15:40:21 · 832 阅读 · 0 评论 -
5086. Smallest Subsequence of Distinct Characters
Return the lexicographically smallest subsequence oftextthat contains all the distinct characters oftextexactly once.Example 1:Input: "cdadabcc"Output: "adbc"Example 2:Input: "abcd"...原创 2019-06-09 14:12:12 · 435 阅读 · 0 评论 -
780. Reaching Points
A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).Given a starting point (sx, sy) and a target point (tx, ty), return True if and only if a sequence of moves ...原创 2018-02-12 11:38:06 · 359 阅读 · 0 评论 -
808. Soup Servings
There are two types of soup: type A and type B. Initially we have N ml of each type of soup. There are four kinds of operations:Serve 100 ml of soup A and 0 ml of soup BServe 75 ml of soup A and 25 ml...原创 2018-04-01 11:08:18 · 562 阅读 · 0 评论 -
390. Elimination Game
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.Repeat the previous step ...原创 2017-05-14 23:03:42 · 222 阅读 · 0 评论 -
894. All Possible Full Binary Trees
A full binary tree is a binary tree where each node has exactly 0 or 2 children.Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node of one p...原创 2018-08-27 10:33:22 · 449 阅读 · 0 评论 -
25. Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the number of ...原创 2018-08-20 09:28:23 · 114 阅读 · 0 评论 -
316. Remove Duplicate Letters
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicographical orde...原创 2017-02-23 14:41:09 · 331 阅读 · 0 评论 -
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-08-21 10:03:11 · 155 阅读 · 0 评论 -
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 \ ...原创 2018-08-21 10:18:52 · 147 阅读 · 0 评论 -
589. N-ary Tree Preorder Traversal & 590. N-ary Tree Postorder Traversal
Given an n-ary tree, return the preorder traversal of its nodes' values.For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2,4].Note: Recursive solution is trivial, ...原创 2018-09-03 19:39:55 · 127 阅读 · 0 评论 -
925. Long Pressed Name
Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times.You examine the typed character...原创 2018-10-21 11:01:09 · 126 阅读 · 0 评论 -
968. Binary Tree Cameras
Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and its immediate children.Calculate the minimum number of cameras needed to...原创 2018-12-30 13:01:33 · 758 阅读 · 0 评论 -
779. K-th Symbol in Grammar
On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each occurrence of 1 with 10.Given row N and index K, r原创 2018-02-04 17:52:32 · 347 阅读 · 0 评论