上一页 1 2 3 4 5 6 7 8 9 10 ··· 16 下一页
摘要: 题目:Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may as... 阅读全文
posted @ 2015-12-17 12:44 lasclocker 阅读(165) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like... 阅读全文
posted @ 2015-12-13 18:33 lasclocker 阅读(110) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 1... 阅读全文
posted @ 2015-12-13 09:35 lasclocker 阅读(152) 评论(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 sure y... 阅读全文
posted @ 2015-12-10 20:43 lasclocker 阅读(1994) 评论(0) 推荐(0) 编辑
摘要: 题目:You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of s... 阅读全文
posted @ 2015-12-06 21:07 lasclocker 阅读(2125) 评论(0) 推荐(0) 编辑
摘要: 题目:Watson给了Sherlock两个整数A和_B_,现在Watson问Sherlock他是否可以计算A和_B_之间(包含A和 B)的完全平方数的个数。完全平方数指的是任何整数的平方。例如,1, 4, 9, 16是完全平方数,因为它们分别是1, 2, 3,4的平方。输入格式 第一行包含一个整数T... 阅读全文
posted @ 2015-12-05 12:00 lasclocker 阅读(202) 评论(0) 推荐(0) 编辑
摘要: 题目:Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime list prime... 阅读全文
posted @ 2015-12-04 21:25 lasclocker 阅读(545) 评论(0) 推荐(0) 编辑
摘要: 题目:Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5... 阅读全文
posted @ 2015-12-04 21:16 lasclocker 阅读(470) 评论(0) 推荐(0) 编辑
摘要: 题目:Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For e... 阅读全文
posted @ 2015-12-04 20:12 lasclocker 阅读(230) 评论(0) 推荐(0) 编辑
摘要: 题目: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 ball... 阅读全文
posted @ 2015-12-01 10:18 lasclocker 阅读(872) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 16 下一页