leetcode 205 Isomorphic Strings C++
2016-06-05 17:24
513 查看
思路是字符串转成数字串。
只要结构相同即可。
string toInt(string s){
vector<int> table(128,0);
int tmp = 0;
for(int i=0;i<s.size();i++){
if(table[s[i]]==0){
table[s[i]] = ++tmp;
}
s[i] = table[s[i]];
}
return s;
}
bool isIsomorphic(string s, string t) {
if(s.size()!=t.size()) return false;
if(toInt(s)!=toInt(t)) return false;
return true;
}
只要结构相同即可。
string toInt(string s){
vector<int> table(128,0);
int tmp = 0;
for(int i=0;i<s.size();i++){
if(table[s[i]]==0){
table[s[i]] = ++tmp;
}
s[i] = table[s[i]];
}
return s;
}
bool isIsomorphic(string s, string t) {
if(s.size()!=t.size()) return false;
if(toInt(s)!=toInt(t)) return false;
return true;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解