1.非递归的解法
先上代码:
public static LinkNode singleReverse(LinkNode node){
if (node == null)
return null;
LinkNode head = null;
LinkNode next = null;
while (node != null){
next = node.next;
node.next = head;
head = node;
node = next;
}
return head;
}
手写解题过程思路: