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 string S is the following:S = "1221121221221121122……"
If we group the consecutive '1's and '2's in S, 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 the S itself.
Given an integer N as input, return the number of '1's in the first N number in the magical string S.
Note:N will not exceed 100,000.
Example 1:
Input: 6 Output: 3 Explanation: The first 6 elements of magical string S is "12211" and it contains three 1's, so return 3.
题意(没看懂):其实这道题的难点就是在于找到规律来生成字符串,这里我们就直接说规律了,因为博主也没有自己找到,都是看了网上大神们的解法。根据第三个数字2开始往后生成数字,此时生成两个1,然后根据第四个数字1,生成一个2,再根据第五个数字1,生成一个1,以此类推,生成的数字1或2可能通过异或3来交替生成。(生成的1/2是交替的,生成个数是由当前指向的数字决定)
代码1:
class Solution {
public:
int magicalString(int n) {
string s = "122";
int i = 2;
while(s.size() < n)
{
s += string(s[i++] - '0', s.back() == '1' ? '2' : '1');
}
return count(s.begin(), s.begin() + n, '1');
}
};
代码2:
class Solution {
public:
int magicalString(int n) {
string s = "122";
int index = 2;
while(s.length() < n) {
int cnt = s[index] - '0';
char c = (s.back() == '1' ? '2' : '1');
string temp(cnt, c);
s += temp;
index++;
}
return count(s.begin(), s.begin() + n, '1');
}
};