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:
Spring Data Java 8 Support
Spring Cloud Bus
Reactive WebSockets with Spring 5
Spring Boot - Cloud Configuration Server
Java Program to Generate Random Numbers Using Multiply with Carry Method
Hướng dẫn Java Design Pattern – Visitor
Debug a HttpURLConnection problem
Different Ways to Capture Java Heap Dumps
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Spring Boot - Tracing Micro Service Logs
Configure a RestTemplate with RestTemplateBuilder
Mapping a Dynamic JSON Object with Jackson
Configure a Spring Boot Web Application
Lập trình mạng với java
Hướng dẫn Java Design Pattern – Iterator
Spring RequestMapping
Apache Commons Collections MapUtils
Java toString() Method
How to Manually Authenticate User with Spring Security
Quick Intro to Spring Cloud Configuration
Java Program to Implement Splay Tree
Guide to CountDownLatch in Java
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Spring Boot - Unit Test Cases
Java Program to Implement HashSet API
Java Program to find the maximum subarray sum O(n^2) time(naive method)
How to Get the Last Element of a Stream in Java?
Java Program to Implement a Binary Search Tree using Linked Lists
Spring MVC Tutorial
Java – Reader to Byte Array
Spring Boot - OAuth2 with JWT
Java Program to Implement AA Tree