com.sl.algorithms.core.interfaces.search.pigeonhole

Interface MissingNumberFinder

All Known Implementing Classes:

LinearTimeMNFinder

public interface MissingNumberFinder

Find the missing number in a list of numbers.

Variants:
1- array of size 'n' where member elements range is {0...n} and one number goes missing.
2- array with integer member elements and we need to find the first missing 'positive' number.
etc.

Method Summary

Modifier and Type	Method and Description
int	findFirstMissingPositive(int[] integers) Reference Problem Scope: Input: integers; Output: positive integer
int	findMissingNumber(int[] nonnegatives) Reference Problem Scope: Input: non-negative integers; Output: non-negative integer.

Method Detail

findFirstMissingPositive

int findFirstMissingPositive(int[] integers)

Reference Problem

Scope: Input: integers; Output: positive integer

Parameters:

integers - input array

Returns:

first positive number missing from the array which can contain any integer

findMissingNumber

int findMissingNumber(int[] nonnegatives)

Reference Problem

Scope: Input: non-negative integers; Output: non-negative integer.

Parameters:

nonnegatives - input array

Returns:

first non-negative missing number missing from the array which contains 0 to n numbers