程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> [LeetCode]Isomorphic Strings

[LeetCode]Isomorphic Strings

編輯:C++入門知識

[LeetCode]Isomorphic Strings


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.

維護兩個哈希表。
第二個哈希表的功能就是保證不能有兩個以上的字母映射到同一個字母。

class Solution {
public:
  bool isIsomorphic(string s, string t) {
        int table[256] = { 0 };
        int table2[256] = { 0 };
        string temp = "";
        for (int i = 0; i < s.size(); i++){
            if (table[s[i]] == 0){
                table[s[i]] = t[i];
            }
            if (table2[t[i]] == 0){
                table2[t[i]] = s[i];
            }
            else if (s[i] != table2[t[i]])
                return false;
            temp.push_back(table[s[i]]);
        }
        if (temp == t)
            return true;
        else
            return false;
    }
};

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved