void delete_two(node *other)
{
if (other != NULL)
{
node *q = (node *)malloc(sizeof(node));
q = other->next;
other->next = q->next;
other->date = q->date;
free(q);
}
}
思想來自《王道程序員面試寶典》
void delete_two(node *other)
{
if (other != NULL)
{
node *q = (node *)malloc(sizeof(node));
q = other->next;
other->next = q->next;
other->date = q->date;
free(q);
}
}
思想來自《王道程序員面試寶典》
一、Trie的介紹: 1、主要應用場景:搜索引擎的自動補全功能:Trie樹+詞頻(概率)權重因子 IP路由:最長前綴匹配,Trie路由算法