Leetcode 481(Java)

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.

题目看了半天，才看懂这个“魔法”。规律是其本身的值是字符串中‘1’和‘2’的计数。选定两个指针，一个指向计数（即重复了几次），一个指向要插入的字符，为了造成当前计数的终止，要插入的字符肯定要与字符串最末尾的字符相异，判断一下即可。AC码如下，要注意的是计数倒数时，char到int的转换，强制转换是无法进行运算的。

public class Solution {
    public int magicalString(int n) {
        StringBuilder str = new StringBuilder("122");
        int count=2;//插入次数
        int index=2;//插入字符
        int length=str.length();
        char insert = 'a';
        while(length<n){
            if(str.charAt(index)=='2')insert='1';
            if(str.charAt(index)=='1')insert='2';
            //此处char到int的转换要注意！
            for(int i = Integer.parseInt(String.valueOf(str.charAt(count)));i>0;i--){
                str.append(insert);
            }
            length = str.length();
            index = length-1;
            count++;
        }
        int result = 0;
        for(int j=0;j<n;j++){
            if(str.charAt(j)=='1')result++;
        }
        return result;
    }
}