前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >LeetCode 0205 - Isomorphic Strings

LeetCode 0205 - Isomorphic Strings

作者头像
Reck Zhang
发布2021-08-11 12:09:40
1630
发布2021-08-11 12:09:40
举报
文章被收录于专栏:Reck Zhang

Isomorphic Strings

Desicription

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.

Example 1:

代码语言:javascript
复制
Input: s = "egg", t = "add"
Output: true

Example 2:

代码语言:javascript
复制
Input: s = "foo", t = "bar"
Output: false

Example 3:

代码语言:javascript
复制
Input: s = "paper", t = "title"
Output: true

Note: You may assume both s and t have the same length.

Solution

代码语言:javascript
复制
class Solution {
public:
    bool isIsomorphic(string s, string t) {
        vector<int> sIndex(256, 0);
        vector<int> tIndex(256, 0);
        for(int i = 0; s[i]; i++) {
            if(sIndex[s[i]] != tIndex[t[i]])
                return false;
            sIndex[s[i]] = i + 1;
            tIndex[t[i]] = i + 1;
        }
        return true;
    }
};
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2018-06-12,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Isomorphic Strings
    • Desicription
      • Solution
      领券
      问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档