这里岂不是在索引层就直接遍历到查找的节点了，无须下沉到第一层去找了

[evilkevinhe]

algo/c-cpp/17_skiplist/skiplist_c/skiplist.c

Lines 239 to 250 in b2c1228

	for(i = list->level - 1; i >= 0; i--)
	{
	while(((tmp = prev->next[i]) != NULL) && (tmp->key <= key))
	{
	if (tmp->key == key)
	{
	*value = tmp->value;
	return 0;
	}
	prev = tmp;
	}
	}

[evilkevinhe]

@jinshaohui 朋友跟你学习一下