Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    990 - Satisfiability of Equality Equations\.

    Medium

    You are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two different forms: <code>"x<sub>i</sub>==y<sub>i</sub>"</code> or <code>"x<sub>i</sub>!=y<sub>i</sub>"</code>.Here, <code>x<sub>i</sub></code> and <code>y<sub>i</sub></code> are lowercase letters (not necessarily different) that represent one-letter variable names.

    Return true if it is possible to assign integers to variable names so as to satisfy all the given equations, or false otherwise.

    Example 1:

    Input: equations = "a==b","b!=a"

    Output: false

    Explanation: If we assign say, a = 1 and b = 1, then the first equation is satisfied, but not the second. There is no way to assign the variables to satisfy both equations.

    Example 2:

    Input: equations = "b==a","a==b"

    Output: true

    Explanation: We could assign a = 1 and b = 1 to satisfy both equations.

    Constraints:

    • 1 &lt;= equations.length &lt;= 500

    • equations[i].length == 4

    • equations[i][0] is a lowercase letter.

    • equations[i][1] is either '=' or '!'.

    • equations[i][2] is '='.

    • equations[i][3] is a lowercase letter.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Boolean equationsPossible(Array<String> equations)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait