题解 | #无环单链表插值#

import java.util.*;

public class Solution {

    public ListNode insert (int[] A, int val) {
        ListNode head = new ListNode(0);
        ListNode temp = head;
        boolean flag = true;
        for (int i=0;i<A.length;i++){
            if (A[i]>val&&flag==true){
                ListNode now = new ListNode(val);
                temp.next = now;
                temp = temp.next;
                flag = false;
            }
            ListNode now = new ListNode(A[i]);
            temp.next = now;
            temp = temp.next;
        }
        if (flag==true){
            ListNode now = new ListNode(val);
            temp.next = now;
            temp = temp.next;
        }
        
        
        return head.next;
    }
}