Букви - второ решение

import java.util.Scanner;

public class StackBukvi {
    public static int check(Stack<Character> stack){
        int brojac=0;
        boolean firstTry=true;
        int cuvaj=0;

        while(!stack.isEmpty()){
            char c=stack.pop();
            if(c=='S'){
                if(firstTry){
                    cuvaj=brojac;
                    firstTry=false;
                }
                if(cuvaj!=brojac){
                    return 0;
                }
                brojac=0;
            }else{
                brojac++;
            }
        }
            return 1;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String line = in.nextLine();

        ArrayStack<Character> stack = new ArrayStack<>(100);
        for (int i = 0; i < line.length(); i++) {
            if (line.charAt(i) == 'S' || line.charAt(i) == 'T') {
                stack.push(line.charAt(i));
            }
        }
        System.out.println(check(stack));
    }
}