LeetCode 205. Isomorphic Strings
2016-11-26 12:32
399 查看
描述
判断两个字符串是否同构解决
记录每个字符前一次出现的位置，判断即可。注意不要初始化vector为0，因为字符从索引号为0开始遍历的。class Solution {
public:
bool isIsomorphic(string s, string t) {
int length = s.size();
if (length == 0)
return true;
vector<int> arr0(256, -1), arr1(256, -1);
for (int i = 0; i < length; ++i)
{
if (arr0[s[i]] != arr1[t[i]])
return false;
arr0[s[i]] = i;
arr1[t[i]] = i;
}
return true;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 205. Isomorphic Strings 巧妙使用hashmap.put返回值求解
- leetcode 205. Isomorphic Strings
- LeetCode 205. Isomorphic Strings
- Leetcode 205. Isomorphic Strings
- LeetCode 205. Isomorphic Strings
- leetCode 205. Isomorphic Strings 哈希 字符串相似
- [LeetCode] 205. Isomorphic Strings 解题思路 - Java
- [LeetCode]205. Isomorphic Strings
- Leetcode-205. Isomorphic Strings
- LeetCode笔记：205. Isomorphic Strings
- 【LeetCode】205. Isomorphic Strings
- 【LeetCode】205. Isomorphic Strings
- leetcode 205. Isomorphic Strings
- LeetCode *** 205. Isomorphic Strings
- leetcode 205. Isomorphic Strings 同构字符串判断 + HashMap
- leetcode-205. Isomorphic Strings
- [Leetcode] 205. Isomorphic Strings 解题报告
- leetcode205. isomorphic strings
- leetcode 205. Isomorphic Strings-字符匹配|哈希表
- leetcode 205. Isomorphic Strings