44. Wildcard Matching（通配符匹配）

最新推荐文章于 2022-03-17 10:21:04 发布

起个好听的名字还挺难

最新推荐文章于 2022-03-17 10:21:04 发布

阅读量404

点赞数

分类专栏： LeetCode 文章标签：算法 pattern matching wildcard

本文链接：https://blog.youkuaiyun.com/qq_32142535/article/details/78314744

版权

44. Wildcard Matching（通配符匹配）

Wildcard Matching通配符匹配

题目链接

https://leetcode.com/problems/wildcard-matching/description/

题目描述

Implement wildcard pattern matching with support for '?' and '*'.

‘?’ Matches any single character.
‘*’ Matches any sequence of characters (including the empty sequence).

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”, “*”) → true
isMatch(“aa”, “a*”) → true
isMatch(“ab”, “?*”) → true