Java: Check if the sum of all the 10's in the array is exactly 30
31. Check if total of 10s equals 30
Write a Java program to check if the sum of all the 10's in the array is exactly 30. Return false if the condition does not satisfy, otherwise true.
Pictorial Presentation:
Sample Solution:
Java Code:
// Import the java.util package to use utility classes, including Arrays.
import java.util.*;
// Import the java.io package to use input and output classes.
import java.io.*;
// Define a class named Exercise31.
public class Exercise31 {
// The main method for executing the program.
public static void main(String[] args) {
// Declare and initialize an array of integers.
int[] array_nums = {10, 77, 10, 54, -11, 10};
// Print the original array.
System.out.println("Original Array: " + Arrays.toString(array_nums));
// Define the search number and the fixed sum.
int search_num = 10;
int fixed_sum = 30;
// Call the result method with the array, search number, and fixed sum as arguments and print the result.
System.out.println("Result: " + result(array_nums, search_num, fixed_sum));
}
// Define a method named result that takes an array of integers, a search number, and a fixed sum as inputs.
public static boolean result(int[] numbers, int search_num, int fixed_sum) {
// Initialize a temporary sum.
int temp_sum = 0;
// Use an enhanced for loop to iterate through the array elements.
for (int number : numbers) {
// Check if the current number is equal to the search number.
if (number == search_num) {
// Add the search number to the temporary sum.
temp_sum += search_num;
}
// Check if the temporary sum exceeds the fixed sum.
if (temp_sum > fixed_sum) {
// If the sum exceeds the fixed sum, exit the loop.
break;
}
}
// Check if the temporary sum is equal to the fixed sum and return the result.
return temp_sum == fixed_sum;
}
}
Sample Output:
Original Array: [10, 77, 10, 54, -11, 10] Result: true
Flowchart:
For more Practice: Solve these Related Problems:
- Write a Java program to check if the sum of all 5’s in an array is exactly 25.
- Write a Java program to check if the product of all prime numbers in an array is a perfect square.
- Write a Java program to check if an array contains a specified number exactly 'n' times.
- Write a Java program to determine if the sum of all odd numbers in an array is a prime number.
Go to:
PREV : Check if array excludes 0 and -1.
NEXT : Check if array has 65 and 77.
Java Code Editor:
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.