CareerCup

boolean matchPattern(String p,String ex)
	{
		ex=ex.replace("#",".+");
		p=p.replaceFirst(ex,"");
		if(p.equals(""))
		{
			return true;
		}
		return false;
	}

logic is create a regex using the pattern and match the string.
# is any character atleast once, same as ".+" in regex

boolean matchPattern(char* str, char* pat)
{
    if(*str == '\0' && *pat == '\0)'{
  	return true;
    }

    if(*exp == '#'' && *(exp+1) != '\0' && '*str == '\0) {
    	return true;
    }

    if(*str == *exp)  {
	matchPattern(exp + 1, pat +1);
    }

    if(*exp = '#')'{
         return matchPattern(exp +1, pat) || matchPattern(exp, pat + 1);
    }

    return false; 
}

void regex_match(char *str, char* reg)
{
int i=0, j=0, k=0, l=0, flag=0, lenstr, lenreg;
lenstr=strlen(str);
lenreg=strlen(reg);
while(i < lenreg)
{
printf("i = %d j = %d\n", i, j);
printf("reg[i] = %c\n", reg[i]);
printf("str[j] = %c\n", str[j]);
if(reg[i]!='#')
{
if(reg[i] == str[j])
{
i++;j++;
}
else
{
printf("Error\n");
break;
}
}
else
{
if(flag == 1 && str[j]==reg[i+1])
{
i++;
flag=0;
}
else
{
j++;
flag=1;
}
}
}


}

static boolean stingMatching(String p, String ex)
{
String pattern = ex.replace("#", ".+");
if(p.matches(pattern))
return true;
return false;
}

static boolean stringMatching(String p, String ex)
	{
		String pattern = ex.replace("#", ".+");
		if(p.matches(pattern))
			return true;
		return false;
	}