This is a java program to solve a linear equation in one variable.
Here is the source code of the Java Program to Solve any Linear Equation in One Variable. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to find the solution to the linear equation in single variable import java.util.Scanner; public class LEquation { public static void main(String args[]) { String eqn = ""; float ans = 0; float coeffSum = 0; float constSum = 0; float coeffx[] = new float[100]; float[] constant = new float[100]; Scanner in = new Scanner(System.in); System.out.println("Enter a linear equation\n"); eqn = in.nextLine(); eqn += "\n"; // System.out.println(eqn); for (int i = 0, j = 0, k = 0; i < eqn.length() - 1;) { if (eqn.charAt(i + 1) == 'x' && i < eqn.indexOf("=")) { if (i != 0 && eqn.charAt(i - 1) == '-') { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = -(Integer.parseInt(x, 10)); coeffx[j++] = n; } } else { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = Integer.parseInt(x, 10); coeffx[j++] = n; } } i += 3; } if (eqn.charAt(i + 1) == 'x' && i > eqn.indexOf("=")) { if (eqn.charAt(i - 1) == '-') { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = Integer.parseInt(x, 10); coeffx[j++] = n; } } else { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = -(Integer.parseInt(x, 10)); coeffx[j++] = n; } } i += 3; } if (eqn.charAt(i + 1) != 'x' && i < eqn.indexOf("=")) { if (eqn.charAt(i - 1) == '-') { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = -(Integer.parseInt(x, 10)); constant[k++] = n; } } else { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = Integer.parseInt(x, 10); constant[k++] = n; } } i += 2; } if (eqn.charAt(i + 1) != 'x' && i > eqn.indexOf("=")) { if (eqn.charAt(i - 1) == '-') { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = Integer.parseInt(x, 10); constant[k++] = n; } } else { String x = eqn.substring(i, i + 1); if (x != "+" && x != "-") { int n = -(Integer.parseInt(x, 10)); constant[k++] = n; } } i += 2; } } for (int i = 0; i < coeffx.length; i++) coeffSum += coeffx[i]; for (int i = 0; i < constant.length; i++) constSum += constant[i]; ans = constSum / coeffSum; System.out.println("Value of x = " + (-ans)); in.close(); } }
Output:
$ javac LEquation.java $ java LEquation Enter a linear equation 2x+5=4x+9 Value of x = -2.0
Related posts:
Custom Cascading in Spring Data MongoDB
Interface trong Java 8 – Default method và Static method
Spring Boot - Service Components
Java Program to Implement LinkedBlockingDeque API
Giới thiệu JDBC Connection Pool
Java Program to Implement Brent Cycle Algorithm
Using Spring ResponseEntity to Manipulate the HTTP Response
Java Program to Compute the Area of a Triangle Using Determinants
Guide To CompletableFuture
Java Program to Perform Naive String Matching
Join and Split Arrays and Collections in Java
Java Program to Implement CountMinSketch
Exception Handling in Java
Java Program to Implement Binomial Tree
A Guide to Java 9 Modularity
Collect a Java Stream to an Immutable Collection
Java Program to Implement RoleUnresolvedList API
Period and Duration in Java
Spring Boot Actuator
A Guide to the Java LinkedList
Java Program to Apply Above-Below-on Test to Find the Position of a Point with respect to a Line
Java Program to Implement Min Hash
Constructor Injection in Spring with Lombok
Java Program to Implement Depth-limited Search
The DAO with Spring and Hibernate
OAuth 2.0 Resource Server With Spring Security 5
Introduction to Spring Data REST
A Guide to the Java ExecutorService
Java Program to Implement Pollard Rho Algorithm
Java Program to Implement Iterative Deepening
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself