以升序将元素插入ArrayList且没有重复的元素

这是我的处理方式：（注释中的解释）

public void insert(int x){    // loop through all elements    for (int i = 0; i < size(); i++) {        // if the element you are looking at is smaller than x,         // go to the next element        if (get(i) < x) continue;        // if the element equals x, return, because we don't add duplicates        if (get(i) == x) return;        // otherwise, we have found the location to add x        add(i, x);        return;    }    // we looked through all of the elements, and they were all    // smaller than x, so we add ax to the end of the list    add(x);}

您发布的当前解决方案看起来大部分都是正确的，除了它不会按升序保存元素的事实。