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:
@Order in Spring
Spring 5 Testing with @EnabledIf Annotation
Injecting Prototype Beans into a Singleton Instance in Spring
Introduction to the Java NIO Selector
Immutable ArrayList in Java
Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
Java 14 Record Keyword
Introduction to Eclipse Collections
JUnit 5 for Kotlin Developers
Guide to the Synchronized Keyword in Java
Java Program to Implement HashSet API
Java Program to Implement Selection Sort
Java Program to Find Number of Articulation points in a Graph
Guide to Java OutputStream
Biến trong java
Java Program to Implement Heap’s Algorithm for Permutation of N Numbers
Spring @RequestMapping New Shortcut Annotations
Hướng dẫn Java Design Pattern – Command
Easy Ways to Write a Java InputStream to an OutputStream
Upload and Display Excel Files with Spring MVC
Control Structures in Java
Một số ký tự đặc biệt trong Java
Handle EML file with JavaMail
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
Spring Boot - Quick Start
Java Program to Find the GCD and LCM of two Numbers
Java Program to Implement Control Table
Java Program to Find the Mode in a Data Set
HttpClient Timeout
Generating Random Dates in Java
Java Program to Implement Bresenham Line Algorithm
Converting Between Byte Arrays and Hexadecimal Strings in Java