Problem Statement |
| | You are given a String that initially contains only a single letter. After every second of time, all occurrences of the letter 'a' are replaced with "acb", all occurrences of the letter 'b' are replaced with "baa", and all occurrences of the letter 'c' are replaced with "bcb". These replacements happen simultaneously during each second. You are given three ints: left, right, and nSeconds. Take the substring between positions left and right (both 0-based), inclusive, after nSeconds, and return a int[] containing exactly 3 elements. The first element is the number of 'a's in the substring, the second element is the number of 'b's, and the third element is the number of 'c's. For example, if letter = "a", then after 2 seconds, the string will be "acbbcbbaa". If left = 2 and right = 6, the substring is "bbcbb", which contains no 'a's, 4 'b's, and 1 'c'. Therefore, you will return {0, 4, 1}.
|
| |
Definition |
| | | Class: | StringReplacements | | Method: | substringCounter | | Parameters: | String, int, int, int | | Returns: | int[] | | Method signature: | int[] substringCounter(String letter, int left, int right, int nSeconds) | | (be sure your method is public) |
|
| |
|
| |
Constraints |
| - | letter will be equal to "a", "b" or "c". |
| - | right will be between 0 and (3^nSeconds)-1, inclusive. |
| - | left will be between 0 and right, inclusive. |
| - | nSeconds will be between 0 and 20, inclusive. |
| - | left and right will each be less than or equal to 2147483647. |
| |
Examples |
| 0) | |
| | | Returns: {0, 4, 1 } | | The example from the problem statement. |
|
|
| 1) | |
| | | Returns: {1, 1, 1 } | | The resulting string will be "acb". |
|
|
| 2) | |
| | |
| 3) | |
| | |