題解 | 反轉(zhuǎn)鏈表
反轉(zhuǎn)鏈表
http://fangfengwang8.cn/practice/75e878df47f24fdc9dc3e400ec6058ca
import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * } * } */ public class Solution { /** * 代碼中的類名、方法名、參數(shù)名已經(jīng)指定,請(qǐng)勿修改,直接返回方法規(guī)定的值即可 * * * @param head ListNode類 * @return ListNode類 */ public ListNode ReverseList (ListNode head) { // write code here // return result if(head == null){ return null; } // node is not null // create new node ListNode node = new ListNode(head.val); // where next of next is not null while(head.next != null){ // foreach next node, create new node head = head.next; ListNode temp = new ListNode(head.val); temp.next = node; node = temp; } return node; } }