Package g0201_0300.s0205_isomorphic_strings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    205 - Isomorphic Strings.

    Easy

    Given two strings s and t, determine if they are isomorphic.

    Two strings s and t are isomorphic if the characters in s can be replaced to get t.

    All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself.

    Example 1:

    Input: s = "egg", t = "add"

    Output: true

    Example 2:

    Input: s = "foo", t = "bar"

    Output: false

    Example 3:

    Input: s = "paper", t = "title"

    Output: true

    Constraints:

    • <code>1 <= s.length <= 5 * 10<sup>4</sup></code>

    • t.length == s.length

    • s and t consist of any valid ascii character.

    • 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 isIsomorphic(String s, String t)

      • Methods inherited from class java.lang.Object

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