题解 | 序列链表化

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param arr int整型一维数组
     * @return ListNode类
     */
    public ListNode vectorToListnode (int[] arr) {
        if (arr == null || arr.length == 0) {
            return null;
        }
        ListNode current = null;
        ListNode currentNext = null;
        // write code here
        for (int i = arr.length; i > 0; i--) {
            current =  new ListNode(arr[i - 1]);
            current.next = currentNext;
            currentNext = current;
        }
        return current;
    }
}