Discuss / Java / 一个一个比较,时间复杂度O(n^2)

一个一个比较,时间复杂度O(n^2)

Topic source

NB

#1 Created at ... [Delete] [Delete and Lock User]
static int findMissingNumber(int start, int end, List<Integer> list) {    int number = start;    boolean isMatch;    for (; number <= end; number++) {        isMatch = false;        for (Integer i : list) {            if (number == i) {                isMatch = true;                break;            }        }        if (!isMatch) {            break;        }    }    return number;}

  • 1

Reply