题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
private ListNode ReverseList(ListNode head) {
if(head==null){
return null;
}
List<ListNode> list=new ArrayList<>();
list.add(head);
while (head.next != null){
list.add(head.next);
head=head.next;
}
for(int i = list.size()-1;i>0;i--){
list.get(i).next=list.get(i-1);
if(i-1==0){
list.get(i-1).next=null;
}
}
return list.get(list.size()-1);
}
，大部分都转正了
