Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.IOException;
- import java.util.ArrayList;
- import java.util.NoSuchElementException;
- import java.util.Scanner;
- interface Stack<E> {
- // Elementi na stekot se objekti od proizvolen tip.
- // Metodi za pristap:
- public boolean isEmpty ();
- // Vrakja true ako i samo ako stekot e prazen.
- public E peek ();
- // Go vrakja elementot na vrvot od stekot.
- // Metodi za transformacija:
- public void clear ();
- // Go prazni stekot.
- public void push (E x);
- // Go dodava x na vrvot na stekot.
- public E pop ();
- // Go otstranuva i vrakja elementot shto e na vrvot na stekot.
- }
- class ArrayStack<E> implements Stack<E> {
- private E[] elems;
- private int depth;
- @SuppressWarnings("unchecked")
- public ArrayStack (int maxDepth) {
- // Konstrukcija na nov, prazen stek.
- elems = (E[]) new Object[maxDepth];
- depth = 0;
- }
- public ArrayStack() {
- }
- public boolean isEmpty () {
- // Vrakja true ako i samo ako stekot e prazen.
- return (depth == 0);
- }
- public E peek () {
- // Go vrakja elementot na vrvot od stekot.
- if (depth == 0)
- throw new NoSuchElementException();
- return elems[depth-1];
- }
- public void clear () {
- // Go prazni stekot.
- for (int i = 0; i < depth; i++) elems[i] = null;
- depth = 0;
- }
- public void push (E x) {
- // Go dodava x na vrvot na stekot.
- elems[depth++] = x;
- }
- public E pop () {
- // Go otstranuva i vrakja elementot shto e na vrvot na stekot.
- if (depth == 0)
- throw new NoSuchElementException();
- E topmost = elems[--depth];
- elems[depth] = null;
- return topmost;
- }
- }
- public class StackBukvi {
- static int proveri_t_posle_s(char [] St) {
- boolean flag = false;
- int br=0;
- int j = 0;
- ArrayList<Integer> br1 = new ArrayList<>();
- ArrayStack<Character> arrayStack = new ArrayStack<>(1000);
- for (char c : St) {
- if (c == 'T'&&flag) {
- arrayStack.push(c);
- br1.add(j, ++br);
- continue;
- }
- if (!arrayStack.isEmpty()&&c == 'S') {
- arrayStack.clear();
- j++;
- br=0;
- }
- if (c == 'S') {
- arrayStack.push(c);
- flag = true;
- }
- }
- if(!arrayStack.isEmpty()){
- br1.remove(j);
- }
- for(int i = 0; i<br1.size()-1;i++){
- if(!br1.get(i).equals(br1.get(i + 1))){
- return 0;
- }
- }
- return 1;
- }
- public static void main(String[] args) throws IOException {
- char [] niza=new char[100];
- Scanner f=new Scanner(System.in);
- String st=f.next();
- niza=st.toCharArray();
- int rez= proveri_t_posle_s(niza);
- System.out.println(rez);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement