Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example: 100.5 65 pizza 100 45.75 70 5.8 5 Also suppose that you have two integers n and m that are both positive. For example: n = 5 and m = 10 Write a static method: public static int partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m. In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70. If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null.
Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example:
100.5 65 pizza 100 45.75 70 5.8 5
Also suppose that you have two integers n and m that are both positive. For example:
n = 5 and m = 10
Write a static method: public static int partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m.
In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70.
If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images