String matching problem

problem ：
Give an input string s( Not included . and *) And an expression p（ Can contain . and *）. Represents any single character , Cannot represent empty ,* Indicates any one or more preceding child characters , But it can't be used alone . Judge s and p Can it be equal ？

Example ：
s=“aa”,p=“a*”
return true;

thought ：
Discussion by situation , When i+1 Location is not “” when , return true To meet the j<s.length（）,s[j]p[i]||p[i]‘.’, And their next position also meets the conditions ,
The second situation is i+1 The position is equal to “”. such p Jump two positions each time .

Code ：

public static boolean Match(String str,String exp) {
    
		if(str.length()==0||exp.length()==0) {
    
			return false;
		}
		char[] s = str.toCharArray();
		char[] e = exp.toCharArray();
		return isVaild(s,e)&&process(s,e,0,0);
	}
	public static boolean isVaild(char[] s,char[] e) {
    
		for(int i = 0;i<s.length;i++) {
    
			if(s[i]=='.'||s[i]=='*') {
    
				return false;
			}
		}
		for(int i = 0;i<e.length;i++) {
    
			if(e[i]=='*'&&(i==0||e[i-1]=='*')) {
    
				return false;
			}
		}
		return true;
	}
	public static boolean process(char[] s,char[] e,int sl,int el ) {
    
		if(sl == s.length) {
    
			return el == e.length;
		}
		//e[i] Have a character ,e[i+1]!="*"
		if(el+1!=e.length&&e[el+1]!='*') {
    
			return sl!=s.length&&(s[sl]==e[el]||e[el]=='.')&&process(s, e, sl+1, el+1);
		}
		//e[i] Have a character ,e[i+1]=="*"
		while(sl<s.length&&(s[sl]==e[el]||e[el]=='.')) {
    
			if(process(s, e, sl, el+2)) {
    
				return true;
			}
			sl++;
		}
		return process(s, e, sl, el+2);
	}