SlavCodes

Untitled

Nov 3rd, 2019
166
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.19 KB | None | 0 0
  1. import java.util.Scanner;
  2. import java.util.Stack;
  3.  
  4. public class Main {
  5.  
  6. public static void main(String[] args) {
  7. Scanner reader = new Scanner(System.in);
  8. int n = Integer.parseInt(reader.nextLine());
  9. String[] input = new String[n];
  10. Stack<String> closers = new Stack<>();
  11. int spaceCounter =0;
  12.  
  13. for (int i = 0; i <n ; i++) {
  14. input[i] = reader.nextLine();
  15. }
  16.  
  17. for (int i = 0; i <n ; i++) {
  18. System.out.printf("<%s>%n",input[i]);
  19. closers.push(String.format("</%s>%n",input[i]));
  20. if(Integer.parseInt(String.valueOf(input[i].charAt(1))) < Integer.parseInt(String.valueOf(input[i+1].charAt(1)))){
  21. continue;
  22. } else {
  23. System.out.print(closers.pop());
  24. for (int j = 0; j <closers.size() ; j++) {
  25. if(Integer.parseInt(String.valueOf(closers.peek().charAt(3))) >= Integer.parseInt(String.valueOf(input[i+1].charAt(1)))){
  26. System.out.print(closers.pop());
  27. } else {
  28. break;
  29. }
  30. }
  31. }
  32. }
  33. }
  34. }
Advertisement
Add Comment
Please, Sign In to add comment