Java Program to Solve Any Linear Equation in One Variable

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

Sanfoundry Global Education & Learning Series – 1000 Java Programs.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

Here’s the list of Best Books in Java Programming, Data Structures and Algorithms.

« Prev - Java Program to Sort 10 Elements using Heap Sort Algorithm

» Next - Inorder Traversal of a Binary Tree without using Recursion in Java

Next Steps:

Get Free Certificate of Merit in Java Programming
Participate in Java Programming Certification Contest
Become a Top Ranker in Java Programming
Take Java Programming Tests
Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Related Posts:

Recommended Articles: