本来的思路是——关注节点关系的变化,构思是 p1->p3, p2->p1, p3->p2......, 所以写出了下面的代码: function ReverseList(pHead) { if (!pHead) { return null; } let curNode = pHead; let next = pHead.next; while (next) { pHead.next = next.next; next.next = curNode; curNode = next; next = pHead.next...