leetcode481: Magical String

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.

注意：对于字符串频繁操作应当建立StringBuffer，这道题目如果使用String并用“+”添加字符，会导致时间复杂度超出限制。但是建立StringBuffer并使用append方法连接字符就可以通过。

由于初始化了“122”，所以count从1开始，注意判断n=0的情况。

	public int magicalString(int n) {
		if (n == 0)
			return 0;
		int count = 1;
		int index = 2;
		char add;
		StringBuffer s = new StringBuffer();
		s.append("122");
		while (s.length() < n) {
			add = (s.charAt(s.length() - 1) == '1') ? '2' : '1';
			if (s.charAt(index++) == '1') {
				s.append(add);
				count++;
			} else
				s.append(add).append(add);
		}
		for (; index < n; index++)
			if (s.charAt(index) != '2')
				count++;
		return count;
	}