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:
Chuyển đổi từ HashMap sang ArrayList
Spring Security Basic Authentication
Java Program to Perform String Matching Using String Library
REST Web service: Basic Authentication trong Jersey 2.x
Intro to Inversion of Control and Dependency Injection with Spring
How to Remove the Last Character of a String?
Spring Boot - Introduction
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
LinkedHashSet trong java
Hướng dẫn Java Design Pattern – Prototype
A Guide to BitSet in Java
ClassNotFoundException vs NoClassDefFoundError
Spring NoSuchBeanDefinitionException
Spring Cloud AWS – S3
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Java Program to Implement Find all Cross Edges in a Graph
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
String Operations with Java Streams
Spring Data – CrudRepository save() Method
Marker Interface trong Java
An Example of Load Balancing with Zuul and Eureka
Java Program to Check whether Directed Graph is Connected using DFS
Java Program to Create a Random Linear Extension for a DAG
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Guide to the Java Queue Interface
Java Program to Implement Sieve Of Eratosthenes
LinkedList trong java
Java Program to Generate All Possible Combinations of a Given List of Numbers
Spring Cloud AWS – Messaging Support
Service Registration with Eureka
Jackson – Marshall String to JsonNode
Java Program to Implement Quick Hull Algorithm to Find Convex Hull