LeetCode wildcard matching
leetcode

[题目描述]

http://oj.leetcode.com/problems/wildcard-matching/

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

[问题分析]

http://xoomer.virgilio.it/acantato/dev/wildcard/wildmatch.html

[参考代码]

Jian Wang /
« LeetCode single number Java Concurrent Programming[1] - Theory »