µ¥Á´±í£ºÉ¾³ý´øÍ·½Úµãµ¥Á´±íÖÐ×îСֵËùÓÐÔڵĽڵã

struct node {
	int val;
	node *next;
};


void deleteMin(node *head) {
	node *p = head, *q = head->next;
	node *premin = head, *pmin = head->next;
	while (q) {
		if (q->val < pmin->val) {
			pmin = q;
			premin = p;
			p = p->next, q = q->next;
		} else {
			p = p->next;
			q = q->next;
		}
		node *del = pmin;
		premin->next = pmin->next;
		delete del;
	}
}