Advertisement
Ligh7_of_H3av3n

03. Take/Skip Rope

Feb 13th, 2024
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.58 KB | None | 0 0
  1. package MoreExercise;
  2.  
  3. import java.util.ArrayList;
  4. import java.util.Arrays;
  5. import java.util.List;
  6. import java.util.Scanner;
  7.  
  8. public class TakeSkipRope {
  9.     public static void main(String[] args) {
  10.         Scanner scanner = new Scanner(System.in);
  11.  
  12.  
  13.         String textChain = scanner.nextLine();
  14.         List<Integer> numbers = new ArrayList<>();
  15.         List<Character> nonNumbers = new ArrayList<>();
  16.  
  17.         // Step 1: Extract digits and non-digits
  18.         for (char c : textChain.toCharArray()) {
  19.             if (Character.isDigit(c)) {
  20.                 numbers.add(Character.getNumericValue(c));
  21.             } else {
  22.                 nonNumbers.add(c);
  23.             }
  24.         }
  25.  
  26.         // Step 2: Separate take and skip lists
  27.         List<Integer> take = new ArrayList<>();
  28.         List<Integer> skip = new ArrayList<>();
  29.         for (int i = 0; i < numbers.size(); i++) {
  30.             if (i % 2 == 0) {
  31.                 take.add(numbers.get(i));
  32.             } else {
  33.                 skip.add(numbers.get(i));
  34.             }
  35.         }
  36.  
  37.         // Step 3: Construct the result string
  38.         StringBuilder result = new StringBuilder();
  39.         int nonNumIndex = 0;
  40.         for (int i = 0; i < take.size(); i++) {
  41.             int takeCount = take.get(i);
  42.             int skipCount = skip.get(i);
  43.             for (int j = 0; j < takeCount && nonNumIndex < nonNumbers.size(); j++) {
  44.                 result.append(nonNumbers.get(nonNumIndex++));
  45.             }
  46.             nonNumIndex += skipCount;
  47.         }
  48.  
  49.         System.out.println(result.toString());
  50.     }
  51. }
  52.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement