这个程序麻烦帮忙改错ListNode* ReverseList( ListNode* pHead){ ListNode* pNew = pHead; if(pHead-]next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead-]next); pHead-]next-]next= pHead; //防止链环 pHead-]n

来源:学生作业帮助网 编辑:作业帮 时间:2024/05/06 12:34:24
这个程序麻烦帮忙改错ListNode* ReverseList( ListNode* pHead){ ListNode* pNew = pHead; if(pHead-]next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead-]next); pHead-]next-]next= pHead; //防止链环 pHead-]n

这个程序麻烦帮忙改错ListNode* ReverseList( ListNode* pHead){ ListNode* pNew = pHead; if(pHead-]next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead-]next); pHead-]next-]next= pHead; //防止链环 pHead-]n
这个程序麻烦帮忙改错
ListNode* ReverseList( ListNode* pHead)
{ ListNode* pNew = pHead; if(pHead-]next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead-]next); pHead-]next-]next= pHead; //防止链环 pHead-]next=NULL; return pNew; }

这个程序麻烦帮忙改错ListNode* ReverseList( ListNode* pHead){ ListNode* pNew = pHead; if(pHead-]next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead-]next); pHead-]next-]next= pHead; //防止链环 pHead-]n
ListNode* ReverseList( ListNode* pHead){ ListNode* pNew = pHead; if(pHead->next == NULL || pHead ==NULL) { return pHead; } //递归实现 pNew = ReverseList(pHead->next); pHead->next->next= pHead; //防止链环 pHead->next=NULL; return pNew; }
把]都换成>.