Design Compressed String Iterator

Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext.

The given compressed string will be in the form of each letter followed by a positive integer representing the number of this letter existing in the original uncompressed string.

next() - if the original string still has uncompressed characters, return the next letter; Otherwise return a white space.
hasNext() - Judge whether there is any letter needs to be uncompressed.

Note:
Please remember to RESET your class variables declared in StringIterator, as static/class variables are persisted across multiple test cases. Please see here for more details.

Example:

StringIterator iterator = new StringIterator("L1e2t1C1o1d1e1");

iterator.next(); // return 'L'
iterator.next(); // return 'e'
iterator.next(); // return 'e'
iterator.next(); // return 't'
iterator.next(); // return 'C'
iterator.next(); // return 'o'
iterator.next(); // return 'd'
iterator.hasNext(); // return true
iterator.next(); // return 'e'
iterator.hasNext(); // return false
iterator.next(); // return ' '

 1 public class StringIterator {
 2     int i;
 3     String[] arr;
 4     int[] counts;
 5 
 6     public StringIterator(String str) {
 7         arr = str.split("\\d+");
 8         counts = Arrays.stream(str.substring(1).split("[a-zA-Z]+")).mapToInt(Integer::parseInt).toArray();
 9     }
10 
11     public char next() {
12         if (!hasNext()) {
13             return ' ';
14         }
15         char ch = arr[i].charAt(0);
16         counts[i]--;
17 
18         if (counts[i] == 0) {
19             ++i;
20         }
21         return ch;
22     }
23 
24     public boolean hasNext() {
25         if (i == arr.length) {
26             return false;
27         }
28         return true;
29     }
30 }

 

转载于:https://www.cnblogs.com/beiyeqingteng/p/11337589.html