static int findMissingNumber(int start, int end, List<Integer> list) {
		int[] i = new int[end - start + 1];
		for (int m = start; m <= end; m++) {
			i[m - start] = m;
			for (Integer in : list) {
				if (i[m - start] == (int) in)
					i[m - start] = 0;
			}
		}
		int removed = 0;
		for (int n : i) {
			if (n != 0)
				removed = n;
		}
		return removed;
	}