归档 2015

题目描述：

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 = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return ...

题目描述：

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions ...

这是一篇译文，原文链接：http://www.lucenetutorial.com/lucene-vs-solr.html

许多刚刚接触Lucene与Solr的朋友会问一个比较浅显的问题：我应该使用Lucene还是Solr？

答案很简单：如果你问了自己这个问题，99%的情况下，你需要使用的是Solr。

要搞明白Solr与Lucene之间的关系，可以简单地用汽车与引擎做类比。你不能驾驶一台引擎，但是可以驾驶一辆汽车。类似的，Lucene是一个不可以原样使用（use as-is）的编程库，而Solr是一个可以“开箱即用”的完整的应用。

Solr是什么？

Apache Solr是基于Lucene构建并集成了许多额外特性的Web应用程序。

它添加的功能包括：

• XML/HTTP 与 JSON APIs
• 命中高亮
• 分面搜索（Faceted Search）与过滤 ...

题目描述：

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?

Hint:

Expected runtime complexity is in O(log n) and the input is sorted.

题目大意：

H-Index的延伸：如果引用数组是递增有序的，你应该怎样优化算法？

提示：

期望运行时间复杂度为O ...

题目描述：

Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.

According to the definition of h-index on Wikipedia: "A scientist has index h if h of his ...