refactor 481

fishercoder1534 · fishercoder1534 · commit 3f83142a2ed9 · 2020-07-14T06:40:55.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_481.java b/src/main/java/com/fishercoder/solutions/_481.java
@@ -1,40 +1,12 @@
 package com.fishercoder.solutions;
 
-/**
- * 481. 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.
- */
 public class _481 {
 
     public static class Solution1 {
         /**
          * credit: https://discuss.leetcode.com/topic/74917/simple-java-solution-using-one-array-and-two-pointers
          * Algorithm:
-         *
+         * <p>
          * 1. Create an int array a and initialize the first 3 elements with 1, 2, 2.
          * 2. Create two pointers head and tail. head points to the number which will be used to generate new numbers.
          * tail points to the next empty position to put the new number. Then keep generating new numbers until tail >= n.
