交作业 简单实现

Discuss / Java / 交作业简单实现

Back

交作业简单实现

Topic source

谁都打不过的咸鱼苍啊

#1 Created at ... [Delete] [Delete and Lock User]

static int findMissingNumber(int start, int end, List<Integer> list) {

while (list.contains(start)) {

start++;

}

return start;

}

jo白灯

#2 Created at ... [Delete] [Delete and Lock User]

new bee 啊，兄嘚，有点儿东西。

用户7570525982

#3 Created at ... [Delete] [Delete and Lock User]

牛！

Tiko_T

#4 Created at ... [Delete] [Delete and Lock User]

效率不是很高。不过代码的确很短。

Frank8y

#5 Created at ... [Delete] [Delete and Lock User]

public boolean contains(Object o) {
    return indexOf(o) >= 0;
}

public int indexOf(Object o) {
    if (o == null) {
        for (int i = 0; i < size; i++)
            if (elementData[i]==null)
                return i;    
    } else {
        for (int i = 0; i < size; i++)
            if (o.equals(elementData[i]))
                return i;
    }
    return -1;
}

如上所示，每调用一次contains方法都会遍历一次，整体嵌套了两层循环，增加了时间复杂度。