add 1446

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) | |Easy|String|
 |1441|[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) | |Easy|Stack|
 |1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | |Medium|Array|
 |1436|[Destination City](https://leetcode.com/problems/destination-city/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | |Easy|String|

src/main/java/com/fishercoder/solutions/_1446.java

@@ -0,0 +1,17 @@
+package com.fishercoder.solutions;
+
+public class _1446 {
+    public static class Solution1 {
+        public int maxPower(String s) {
+            int max = 0;
+            for (int i = 0; i < s.length(); i++) {
+                int start = i;
+                while (i + 1 < s.length() && s.charAt(i) == s.charAt(i + 1)) {
+                    i++;
+                }
+                max = Math.max(max, i - start + 1);
+            }
+            return max;
+        }
+    }
+}

src/test/java/com/fishercoder/_1446Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1446;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1446Test {
+    private static _1446.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1446.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.maxPower("leetcode"));
+    }
+
+}