算法总结(10)--模式匹配问题

字符串转换，递归等，有很多种情况

---

205. Isomorphic Strings

题目地址

https://leetcode.com/problems/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.

ac代码

利用字符串转换

class Solution {
public:

    string _pattern(string s)
    {
        int len = s.size();
        string pattern = "";
        map<char, int> mp;
        int index = 1;
        for (int i = 0; i < len; i++)
        {
            char c1 = s[i];
            if (mp[c1] == 0)
            {
                mp[c1] = index;
                pattern += ('0' + index);
                index++;
            }
            else{
                int in = mp[c1];
                pattern += ('0' + in);
            }
        }
        return pattern;
    }

    bool isIsomorphic(string s, string t) {

        string p1 = _pattern(s);
        string p2 = _pattern(t);
        return p1 == p2;
    }
};

290. Word Pattern

题目地址

https://leetcode.com/problems/word-pattern/

10. Regular Expression Matching (递归 未解决)

题目地址

https://leetcode.com/problems/regular-expression-matching/

题目描述

Implement regular expression matching with support for ‘.’ and ‘*’

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

ac

主要是的问题，例如 aaaab,与 a*b， 要匹配几个的问题，采用递归求解

/*
    .任意一个字符
    star 前一个字符任意次数  
*/
bool isMatch(char* s, char* p) {
    if (s == NULL || p == NULL || *p == '*')
        return false;
    if (*p == '\0')
        return *s == '\0';

    if (*(p + 1) != '*') //第二个字符不是*
    {
        if (*s == '\0')
            return false;
        if (*p != '.' && *p != *s)
            return false;
        return isMatch(s + 1, p + 1); // 判断下一个字符
    }
    else{
        int slen = strlen(s);
        if (isMatch(s, p + 2))
            return true;
        for (int i = 0; i < slen; ++i)
        {
            if (*p != '.' && *p != *(s + i))
                return false;
            if (isMatch(s + i + 1, p + 2))
                return true;
        }
        return false;
    }
}