zoukankan      html  css  js  c++  java
  • isIsomorphic

    超时版:

    /*
    Given two strings s and t, determine if they are isomorphic.
    
    Two strings 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.
    
    For example,
    Given "egg", "add", return true.
    
    Given "foo", "bar", return false.
    
    Given "paper", "title", return true.
    
    Note:
    You may assume both s and t have the same length.*/
    import java.util.*;
    
    public class Isomorphic_strings {
    
        public static void main(String[] args)
        // TODO Auto-generated method stub
        {
            System.out.println(isIsomorphic("papera", "titlei"));
            /*
             * String str="dauqka"; String str1=str.replace('a','x'); str=str1;
             * System.out.println(str);
             */
    
        }
    
        public static boolean isIsomorphic(String s, String t) {
    
            int x = 0;
            if (s.length() != t.length())
                return false;
            char[] s_chs = s.toCharArray();
            char[] t_chs = t.toCharArray();
            for (int i = 0; i < s_chs.length; i++) {
                if (!(s_chs[i] == t_chs[i])) {
                    for (int j = 0; j < i; j++) {
                        if ((t_chs[j] == t_chs[i]))
                            x = 1;
                    }
                }
                if (x == 0)
                    t = t.replace(t_chs[i], s_chs[i]);
                if (x == 1) {
                    t_chs[i] = s_chs[i];
                    t = String.valueOf(t_chs);
    
                }
                t_chs = t.toCharArray();
            }
    
            return (s.equals(t));
    
        }
    
    }

     AC

    public static boolean isIsomorphic(String s, String t) {
    
            
            Map<Character, Character> hm = new HashMap<Character, Character>();
            if (s.length() != t.length())
                return false;
            char[] s1 = s.toCharArray();
            char[] t1 = t.toCharArray();
            for (int i = 0; i < s1.length; i++) {
                if (hm.containsKey(s1[i])) {
                    if ((t1[i] != hm.get(s1[i])))
                        return false;
                }
                hm.put(s1[i], t1[i]);
            }
    
            return true;
        }
    
    }
  • 相关阅读:
    PyCharm使用(完全图解(最新经典))
    pg存储过程学习
    sql_to_sqlalchemy
    python中嵌入lua解析器
    Python和lua互相调用
    Lupa
    [cb] Unity Editor 添加右键菜单
    [C#] 委托之Action和Func区别
    [反编译U3D]Decompile Unity Resources
    [cb] Assetbundle打包(一)
  • 原文地址:https://www.cnblogs.com/kydnn/p/4548109.html
Copyright © 2011-2022 走看看