Count Pattern Occurrences (Overlapping)

/*
 * Problem : Count matches.
 * Input   : A text and a pattern.
 * Output  : The number of matches.
 * Approach: Try each start.
 * Time    : O(n * m)
 * Space   : O(1)
 * Java    : 8 or newer.
 */
import java.util.Scanner;

public class Main {
    // This method solves the task. It receives the input and returns the answer.
    static int solve(String a, String b) {
        // Step 1: Try every start position where the pattern can still fit inside the text.
        int count = 0;
        for (int start = 0; start + b.length() <= a.length(); start++) {
            // Step 2: regionMatches compares the pattern with the part of the text that begins at start.
            if (a.regionMatches(start, b, 0, b.length())) {
                count++;
            }
        }
        return count;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String a = scanner.next();
        String b = scanner.next();
        System.out.println(solve(a, b));
    }
}