206. Reverse Linked List

/**
* Definition for singly-linked list.
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode reverseList(ListNode head) {
if(head==null) return head;
ListNode result = null ;
ListNode temp = null;
while (head!=null) {
if (head.next!=null)
{temp = head.next;
head.next = result;
result = head;
head = temp;}
else {
head.next = result;
result = head;
head = null;
}
}
return result;
}
}