/**
非Leetcode VIP自力更生供链表打印调试代码
**/
public class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
public static ListNode create(int[] nums) {
ListNode head=null;
ListNode link=null;
for(int i=0;i<nums.length;i++) {
if(head==null) {
head=new ListNode(nums[i]);
link=head;
}else {
link.next=new ListNode(nums[i]);
link=link.next;
}
}
return head;
}
public static void printList(ListNode head) {
System.out.print('[');
while(head!=null) {
System.out.print(head.val);
head=head.next;
}
System.out.println(']');
}
}