Problem Statement
You are given a int[] A. An integer K is irreducible with respect to A if K cannot be represented as a sum of one or more elements from A, where each element of A may be used at most once. Return the smallest positive integer that is irreducible with respect to A.
Definition
- Class:
- IrreducibleNumber
- Method:
- getIrreducible
- Parameters:
- int[]
- Returns:
- int
- Method signature:
- int getIrreducible(int[] A)
- (be sure your method is public)
Constraints
- A will contain between 1 and 3 elements, inclusive.
- Each element of A will be between 1 and 100, inclusive.
Examples
{1,1}
Returns: 3
1 can be expressed as 1, and 2 can be expressed as 1+1.
{1,2}
Returns: 4
{1,3}
Returns: 2
{1,2,4}
Returns: 8
{4, 1, 3}
Returns: 2
{1,1,1}
Returns: 4
{100,100,100}
Returns: 1
{1,2,1}
Returns: 5
{1,3,7}
Returns: 2
{2,4,6}
Returns: 1
{4,2,1}
Returns: 8
{100,1,2}
Returns: 4
{3,2,1}
Returns: 7
{1}
Returns: 2
{2}
Returns: 1
{2 }
Returns: 1
{1, 2, 4 }
Returns: 8
{15, 19 }
Returns: 1
{4, 5, 6 }
Returns: 1
{100 }
Returns: 1
{1, 1, 3 }
Returns: 6
{1, 2, 3 }
Returns: 7
{3 }
Returns: 1
{2, 6, 8 }
Returns: 1
{1 }
Returns: 2
{2, 3, 4 }
Returns: 1
{1, 1, 1 }
Returns: 4
{100, 100, 100 }
Returns: 1
{1, 3, 1 }
Returns: 6
{1, 2, 2 }
Returns: 6
{3, 1, 2 }
Returns: 7
{3, 4, 5 }
Returns: 1
{1, 3, 2 }
Returns: 7
{5, 10, 1 }
Returns: 2
{1, 2, 1 }
Returns: 5