Leetcode_Wildcard Matching，leetcode_wildcard

Leetcode_Wildcard Matching，leetcode_wildcard

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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "*") → trueisMatch("aa", "a*") → trueisMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false
class Solution {public:    bool isMatch(const char *s, const char *p) {       const char * ptr;       const char *str;       bool start = false;       for(ptr=p,str=s; *str!='\0'  ; ){           switch(*ptr){               case '?':               str++,ptr++;               break;               case '*':               start = true;               while(*ptr == '*')                 ptr++;               if(*ptr=='\0')               return true;               p = ptr;               s = str;               break;               default:               if(*ptr != *str){                   if(!start)                   return false;                   ptr = p;                   str = s+1;                   s=s+1;               }              else{                  ptr++;                  str++;              }           }       }       while(*ptr=='*')  ptr++;              return (*ptr == '\0');    }};

java項目報錯The matching wildcard is strict, but no declaration can be found for element 'tx:advic

你的XML檔案：applicationContext.xml裡的'tx:advice'標籤沒有被聲明，所以出現此錯誤。找到這個檔案，修改這個標籤。