public int[] missingNumber(int[] numbers) {
		Arrays.sort(numbers);
		int middleValue = -1;
		for (int i = 0; i < numbers.length - 1; i++) {
			int diff = numbers[i + 1] - numbers[i];
			if (diff == 1) {
				continue;
			} else if (diff != 2 || middleValue > 0) {
				return new int[] {};
			} else if (diff == 2) {
				middleValue = numbers[i] + 1;
			}
		}
		if (middleValue > 0) {
			return new int[] { middleValue };
		}
		if (numbers[0] == 1) {
			return new int[] { numbers[numbers.length - 1] + 1 };
		}
		return new int[] { numbers[0] - 1, numbers[numbers.length - 1] + 1 };

	}