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:
Giới thiệu thư viện Apache Commons Chain
Guide to CopyOnWriteArrayList
Hướng dẫn Java Design Pattern – Command
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Java Map With Case-Insensitive Keys
Zipping Collections in Java
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
A Guide to TreeSet in Java
Introduction to Spring Cloud OpenFeign
Remove All Occurrences of a Specific Value from a List
How to Replace Many if Statements in Java
Introduction to the Functional Web Framework in Spring 5
A Guide to @RepeatedTest in Junit 5
Java Program to Find Nearest Neighbor Using Linear Search
Guide to Guava Multimap
Java Program to implement Priority Queue
Hướng dẫn Java Design Pattern – MVC
Java Program to Describe the Representation of Graph using Adjacency List
A Quick Guide to Using Keycloak with Spring Boot
Spring Boot - Exception Handling
Merging Streams in Java
Java program to Implement Tree Set
Check If a File or Directory Exists in Java
Dynamic Proxies in Java
Phân biệt JVM, JRE, JDK
Java – Reader to InputStream
Java Program to Implement TreeMap API
Java Program to Implement Extended Euclid Algorithm
Deploy a Spring Boot App to Azure
Java Program to Implement Stack using Linked List
Transaction Propagation and Isolation in Spring @Transactional
Java Program to Find a Good Feedback Vertex Set