481 Magical String

481. Magical String​
1. Question
A magical string S consists of only '1' and '2' and obeys the following rules:
The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates the string S itself.
The first few elements of stringSis the following:S= "1221121221221121122……"
If we group the consecutive '1's and '2's inS, it will be:
1 22 11 2 1 22 1 22 11 2 11 22 ......
and the occurrences of '1's or '2's in each group are:
1 2 2 1 1 2 1 2 2 1 2 2 ......
You can see that the occurrence sequence above is theSitself.
Given an integer N as input, return the number of '1's in the first N number in the magical stringS.
Note:N will not exceed 100,000.
Example 1:
1
Input: 6
2
​
3
Output: 3
4
​
5
Explanation:
6
The first 6 elements of magical string S is "12211" and it contains three 1's, so return 3.
Copied!
2. Implementation
(1) Two Pointers
思路: 这道题的关键在于找到形成magical string的规律，这里的规律是从"122"中的第3位开始，，该位置上是数字2，先形成2个1，然后到第四位，该位置上是数字1，形成1个2，然后第5位，该位置上是1, 形成1个1，以此类推
1
class Solution {
2
    public int magicalString(int n) {
3
        if (n <= 0) {
4
            return 0;
5
        }
6
​
7
        if (n <= 3) {
8
            return 1;
9
        }
10
​
11
        int[] sequence = new int[n + 1];
12
        sequence[0] = 1;
13
        sequence[1] = 2;
14
        sequence[2] = 2;
15
        int head = 2, tail = 3;
16
        int res = 1;
17
        int num = 1;
18
​
19
        while (tail < n) {
20
            for (int i = 0; i < sequence[head]; i++) {
21
                sequence[tail] = num;
22
                if (num == 1 && tail < n) {
23
                    ++res;
24
                }
25
                ++tail;
26
            }
27
            num ^= 3;
28
            ++head;
29
        }
30
        return res;
31
    }
32
}
Copied!
3. Time & Space Complexity
Two Pointers: 时间复杂度O(n), 空间复杂度O(n)

391 Perfect Rectangle

380 Insert Delete GetRandom O(1)

Last modified 2yr ago

Copy link

Contents

481. Magical String

1. Question

2. Implementation

3. Time & Space Complexity

481. Magical String​

1. Question

2. Implementation

3. Time & Space Complexity

481. Magical String