theo的博客

include includedefine OVERFLOW -1define OK 1define NULL 0typedef char ElemType; typedef int Status;typedef struct BiTNode { ElemType data; struct BiTNode *lchild, *rchild; }BiTNode, *BiTre

原题： ​ Given a linked list, remove the n-th node from the end of list and return its head. ​ Example: Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from th...

问题描述： Given a linked list, determine if it has a cycle in it. 思路： 采用快慢指针法，快指针每次前进两个节点，慢指针每次前进一个节点 无环条件：node.next=NULL 有环条件：快指针指向的节点=慢指针指向的节点 代码： # Definition for singly-linked list. # class ...