#排序和搜索 · 小土刀 5.0

2016-01-11

Inverted Index

A library is trying to build up a smart computer-aided look up system: user may input a list of key words, and

2016-01-11

在数组中找到第k大的元素

2016-01-11

在一个排序矩阵中找从小到大的第 k 个整数。

2016-01-11

输入n个整数，输出其中最小的k个。

2016-01-11

Given an unsorted array, find the maximum difference between the successive elements in its sorted form.

2016-01-11

对于含有n个数的数组，若n为奇数，则中位数array[n/2+1]，若n为偶数，则中位数为 (array[n/2] + array[n/2+1]) / 2。所以我们当前的目标是设计一种算法能够返回第k大的元素。

2016-01-11

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

2016-01-11

Given an array containing n distinct numbers taken from 0, 1, 2, ...

2016-01-11

Given a set of n nuts of different sizes and n bolts of different sizes.

2016-01-11

用递归的方法找到从1到最大的N位整数。