leetcode Unique Substrings in Wraparound String

Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".

Now we have another string p. Your job is to find out how many unique non-empty substrings of p are present in s. In particular, your input is the string p and you need to output the number of different non-empty substrings of p in the string s.

Note: p consists of only lowercase English letters and the size of p might be over 10000.

Example 1:

Input: "a"Output: 1Explanation: Only the substring "a" of string "a" is in the string s.

Example 2:

Input: "cac"Output: 2Explanation: There are two substrings "a", "c" of string "cac" in the string s.

Example 3:

Input: "zab"Output: 6Explanation: There are six substrings "z", "a", "b", "za", "ab", "zab" of string "zab" in the string s.

public class Solution {    public int findSubstringInWraproundString(String p) {        int[] table=new int[26];        for(int i=0;i<p.length();){            boolean mark=false;            if(table[p.charAt(i)-'a']==0){               table[p.charAt(i)-'a']=1;             }            int j=i+1;            for(;j<p.length();j++){                if(p.charAt(j)-p.charAt(j-1)==1||(p.charAt(j-1)=='z'&&p.charAt(j)=='a')){                    mark=true;                    if(table[p.charAt(j)-'a']<(j-i+1)){                        table[p.charAt(j)-'a']=(j-i+1);                    }                }else{                    break;                }            }            if(mark){                i=j;            }else{                i++;            };        }        int count=0;        for(int i=0;i<26;i++){            //System.out.print(table[i]);            //System.out.print('\n');            count+=table[i];        }        return count;    }}