Write a short Java method that takes an integer n and returns the sum of all the odd positive integers less than or equal to n.
package java_problems_datastructures;
import java.util.Scanner;
public class SumOfOddNumbers {
public static void main(String args[]) {
// Take the input from the console
Scanner scanner = new Scanner(System.in);
System.out.println("enter the number \n");
int number = scanner.nextInt();
// create an array to store odd numbers
int[] oddNumbers = new int[number / 2 + 1];
scanner.close();
// push those odd numbers into an array
int i = 0;
long sum = 0;
for (int odd = 1; odd <= number; odd++) {
if (odd % 2 == 1) {
oddNumbers[i++] = odd;
}
}
// Calucualating the sum of odds through a loop
for (i = 0; i < oddNumbers.length; i++) {
sum += oddNumbers[i];
}
// print the sum
System.out.println("sum of all odd positive integers less than or equal to " + number + " is " + sum);
}
}
//method tht takes an integer and calculates sum of all integers tht are odd public static int intOddSum(int n) { int i, sum = 0; for(i = 0; i<=n; i++) { if ((i%2) == 1){ sum += i; } } return sum; }
//driver method public class multipleCheck { public static void main(String[] args) { System.out.println(intOddSum(5)); }
Post the discussion to improve the above solution.