[LeetCode]206. Reverse Linked List

1publicclassSolution{
2publicListNodereverseList(ListNodehead){
3if(head==null||head.next==null)returnhead;
4ListNodepre=head;
5head=head.next;
6pre.next=null;
7while(head!=null){
8ListNodenext=head.next;
9head.next=pre;
10pre=head;
11head=next;
12}
13returnpre;
14}
15}

1publicclassSolution{
2publicListNodereverseList(ListNodehead){
3if(head==null||head.next==null)returnhead;
4ListNodepre=head;
5head=head.next;
6ListNodenewhead=reverseList(head);
7pre.next=null;
8head.next=pre;
9returnnewhead;
10
11}
12}