hairrrrr / c-crashcourse Goto Github PK

part* find_part(part* head, int number) {
	part* cur;

	// 链表是按照编号升序排序的
	for (cur = head->next; cur != NULL && cur->number > number;
		cur = cur->next)
		;
	
	if (cur == NULL)
		return NULL;

	if (cur->number == number)
		return cur;
}

for (cur = head->next; cur != NULL && cur->number < number;
		cur = cur->next)
		; // 小于number，否则cursor不会移动，找不到正确的节点