Fork me on GitHub
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 36 下一页
摘要: Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloon 阅读全文
posted @ 2017-06-26 18:07 hellowOOOrld 阅读(233) 评论(0) 推荐(0)
摘要: Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. We define an in 阅读全文
posted @ 2017-06-25 12:47 hellowOOOrld 阅读(682) 评论(0) 推荐(0)
摘要: There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be ta 阅读全文
posted @ 2017-06-25 12:42 hellowOOOrld 阅读(632) 评论(0) 推荐(0)
摘要: Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Example 2: Note: 思路: 首先排序,然后分别判断数组元素最大值 阅读全文
posted @ 2017-06-25 11:16 hellowOOOrld 阅读(1951) 评论(2) 推荐(0)
摘要: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you nee 阅读全文
posted @ 2017-06-25 08:54 hellowOOOrld 阅读(232) 评论(0) 推荐(0)
摘要: Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文
posted @ 2017-06-24 15:59 hellowOOOrld 阅读(187) 评论(0) 推荐(0)
摘要: Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be 阅读全文
posted @ 2017-06-24 15:10 hellowOOOrld 阅读(257) 评论(0) 推荐(0)
摘要: Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文
posted @ 2017-06-23 17:44 hellowOOOrld 阅读(218) 评论(0) 推荐(0)
摘要: Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum pro 阅读全文
posted @ 2017-06-23 15:46 hellowOOOrld 阅读(193) 评论(0) 推荐(0)
摘要: Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example:Given n = 2, return 91. (The answer should be the 阅读全文
posted @ 2017-06-23 13:55 hellowOOOrld 阅读(165) 评论(0) 推荐(0)
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 36 下一页