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

import java.util.*;

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

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param A int整型一维数组 
     * @param val int整型 
     * @return ListNode类
     */
    public ListNode insert (int[] A, int val) {
        // write code here
        ListNode valNode = new ListNode(val);
        Queue<ListNode> queue = new LinkedList<>();
        int sign = 0;
        for (int i = 0; i < A.length; i++) {
            ListNode tmp = new ListNode(A[i]);
            if (A[i] > val && sign == 0) {
                queue.add(valNode);
                sign = 1;
            }
            queue.add(tmp);
        }
        if (sign == 0) {
            queue.add(valNode);
        }
        ListNode head = queue.poll();
        ListNode node = head;
        while (!queue.isEmpty()) {
            node.next = queue.poll();
            node = node.next;
        }
        return head;
    }
}