摘要：
题目如下： Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at 阅读全文
posted @ 2019-03-13 17:23
seyjs
阅读(212)
评论(0)
推荐(0)
摘要：
题目如下： The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid ou 阅读全文
posted @ 2019-03-11 10:20
seyjs
阅读(205)
评论(0)
推荐(0)
摘要：
题目如下： Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words. A concatenate 阅读全文
posted @ 2019-03-11 10:06
seyjs
阅读(291)
评论(0)
推荐(0)
摘要：
题目如下： In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - o 阅读全文
posted @ 2019-03-11 09:59
seyjs
阅读(700)
评论(0)
推荐(0)
摘要：
题目如下： Normally, the factorial of a positive integer n is the product of all positive integers less than or equal to n. For example, factorial(10) = 10 阅读全文
posted @ 2019-03-11 09:51
seyjs
阅读(379)
评论(0)
推荐(0)
摘要：
题目如下： Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i]with -A[i], and we repeat this proce 阅读全文
posted @ 2019-03-11 09:46
seyjs
阅读(273)
评论(0)
推荐(0)
摘要：
题目如下： Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sur 阅读全文
posted @ 2019-03-08 15:20
seyjs
阅读(152)
评论(0)
推荐(0)
摘要：
题目如下： Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order. Note: Example 1: 阅读全文
posted @ 2019-03-08 14:00
seyjs
阅读(202)
评论(0)
推荐(0)
摘要：
题目如下： Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Note 阅读全文
posted @ 2019-03-08 11:10
seyjs
阅读(155)
评论(0)
推荐(0)
摘要：
题目如下： Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Fi 阅读全文
posted @ 2019-03-08 11:06
seyjs
阅读(189)
评论(0)
推荐(0)
浙公网安备 33010602011771号