Method small

src/class149/SkipList1.java:194–205

(int i, int h, int num)

	// 当前在i号节点的h层，查询有多少个数字比num小
	public static int small(int i, int h, int num) {
		int rightCnt = 0;
		while (next[i][h] != 0 && key[next[i][h]] < num) {
			rightCnt += len[i][h];
			i = next[i][h];
		}
		if (h == 1) {
			return rightCnt;
		} else {
			return rightCnt + small(i, h - 1, num);
		}
	}

	// 查询排名第x的key是什么
	public static int index(int x) {