【leetcode】Isomorphic Strings
2015-05-23 10:51
232 查看
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
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) { map<char,char>mp; for(int i=0;i<s.size();i++) { if(mp.find(s[i])==mp.end()) mp[s[i]]=t[i]; else if(mp[s[i]]!=t[i]) return false; } mp.clear(); for(int i=0;i<s.size();i++) { if(mp.find(t[i])==mp.end()) mp[t[i]]=s[i]; else if(mp[t[i]]!=s[i]) return false; } return true; } };
相关文章推荐
- 【LEETCODE】205-Isomorphic Strings
- LeetCode -- Isomorphic Strings
- Isomorphic Strings Leetcode JAVA
- leetcode 日经贴,Cpp code -Isomorphic Strings
- LeetCode205 Isomorphic Strings
- 【leetcode】Isomorphic Strings
- leetcode之Isomorphic Strings
- leetcode 205: Isomorphic Strings
- [LeetCode] Isomorphic Strings
- Leetcode 205 Isomorphic Strings
- LeetCode--Isomorphic Strings
- Leetcode: Isomorphic Strings
- leetcode题解之Isomorphic Strings
- Leetcode#205. Isomorphic Strings
- leetcode: (205) Isomorphic Strings
- [LeetCode]Isomorphic Strings
- LeetCode 205. Isomorphic Strings(C++版)
- leetcode_c++:哈希: Isomorphic Strings(205)
- [Leetcode] Isomorphic Strings
- [LeetCode] Isomorphic Strings