Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.IOException;
- 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 boolean isEmpty () {
- // Vrakja true ako i samo ako stekot e prazen.
- return (depth == 0);
- }
- public int size() {
- return depth;
- }
- 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) {
- ArrayStack stek=new ArrayStack(St.length);
- Integer brS=0;
- for(int i=0; i<St.length; i++) {
- if(St[i]=='S') {
- brS++;
- }
- }
- Integer brojac=0;
- Integer temp2=0;
- Integer temp=0;
- boolean flag=false;
- for(int i=0; i<St.length; i++) {
- if(flag==false) {
- if(St[i]=='S') {
- flag=true;
- temp2++;
- }
- } else if(flag==true) {
- if(St[i]=='S') {
- if(stek.size()!=temp&&temp2!=1&&temp2!=3) {
- return 0;
- } else {
- temp2++;
- temp=stek.size();
- stek.clear();
- }
- } else if(St[i]=='T') {
- stek.push(St[i]);
- }
- }
- }
- if(stek.size()!=0) {
- if(stek.size()!=temp) {
- return 0;
- } else {
- return 1;
- }
- } else if(stek.size()==0) {
- if(brS==temp2 && temp2!=stek.size()) {
- 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