Magical String问题及解法

最新推荐文章于 2024-08-26 07:47:50 发布

我们要爱学习

最新推荐文章于 2024-08-26 07:47:50 发布

阅读量436

点赞数 1

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77877789

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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 Sitself.

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.

示例：

Input: 6
Output: 3
Explanation: The first 6 elements of magical string S is "12211" and it contains three 1's, so return 3.

问题分析：

本题主要考查该字符串的创建过程，可利用双指针，count - 1用来指示字串最后一个元素的索引，i 用来表示下一组生成的元素的个数。

过程详见代码：

class Solution {
public:
    int magicalString(int n) {
        if (n < 1) return 0;
		vector<int> v(n, 0);
		v[0] = 1;
		v[1] = 2;
		int res = 1,count = 1, i = 1;

		while (count < n)
		{
			int val = v[count - 1] % 2 + 1;
			int t = v[i];
			while (count < n && t--)
			{
				v[count++] = val;
				if (val == 1) res++;
			}
			i++;
		}
		return res;
    }
};