Leetcode||44. Wildcard Matching

最新推荐文章于 2020-03-04 23:11:21 发布

徐州牧

最新推荐文章于 2020-03-04 23:11:21 发布

阅读量236

点赞数

分类专栏： leetcode python 文章标签： leetcode python

本文链接：https://blog.csdn.net/Lingfu74/article/details/78294758

版权

leetcode 同时被 2 个专栏收录

99 篇文章 0 订阅

订阅专栏

python

69 篇文章 0 订阅

订阅专栏

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
isMatch("aab", "c*a*b") → false

一个动态规划的做法，两组str，对比匹配。

class Solution(object):
    def isMatch(self, s, p):
        """
        :type s: str
        :type p: str
        :rtype: bool
        """
        i = 0
        j = 0
        s_star = 0
        star = -1
        while i < len(s):
        	if j < len(p) and (s[i] == p[j] or p[j] == '?'):
        		i += 1
        		j += 1
        	elif j < len(p) and p[j] == '*':
        		star = j
        		j += 1
        		s_star = i
        	elif star != -1:
        		j = star + 1
        		s_star += 1
        		i = s_star
        	else:
        		return False
        while j < len(p) and p[j] == '*':
        	j += 1
        if  j == len(p):
        	return True
        	pass
        return False