List逆转

来源:互联网 发布:淘宝拖鞋底 编辑:程序博客网 时间:2024/06/05 14:46
void ReveseListNodes(ListNode *&node){if (!node || !node->m_next)return;ListNode *p = node;ListNode*pp = p;ListNode*ppp = NULL;while (p){pp = p;p = p->m_next;pp->m_next = ppp;ppp = pp;}node = pp;}void main(){int arr[] = { 12, 11, 10, 9 ,8 ,7, 6, 5, 4, 3, 2, 1, 0 };int *ptr = arr;ListNode *root = NULL;createListNode(root,ptr,sizeof(arr)/sizeof(arr[0]));pressListNodeShow(root);ReveseListNodes(root);pressListNodeShow(root);deleteListNode(root);system("pause");



0 0
原创粉丝点击