Test Writing: Subset Total
Created By: Chris Taylor
/ Version: 2023.7.0
Write the recursive method, subsetTotal(int[] nums, int total, int start)
,
that, when called by the provided subsetTotal(int[] nums, int total)
method,
returns true if the sum of any subset of values in nums
is equal to total
.
You may assume that nums
is not null.
Test Design Challenge
You're challenge is to write tests for this problem described above.
- Provide a method named test that accepts no arguments and does not return a value.
- If the implementation of the class described above is incorrect, your test method should throw an exception.
- If it is correct, do not throw an exception.
- You may want to use Java's assert method
boolean subsetTotal(int[] nums, int total, int start) {
return false;
}
boolean subsetTotal(int[] nums, int total) {
return subsetTotal(nums, total, 0);
}