Is Subsequence LeetCode solution in Java

1
class Solution {
2
  public boolean isSubsequence(String s, String t) {
3
    int i, x, p = -1;
4
    if (s.length() > t.length()) return false;
5
    for (i = 0; i < s.length(); i++) {
6
      x = t.indexOf(s.charAt(i), p + 1);
7
      if (x > p) p = x;
8
      else return false;
9
    }
10
    return true;
11
  }
12
}