solves consecutive chacters

Author: anishLearnsToCode

README.md

@@ -367,7 +367,7 @@
 | 1436 | [Destination City](https://leetcode.com/problems/destination-city)                                                                                   |                                                                 [![Java](assets/java.png)](src/DestinationCity.java)                                                                 |                                                                                                                                   |
 | 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)                |                                                        [![Java](assets/java.png)](src/CheckIfAll1sAreAtLeastKPlacesAway.java)                                                        |                                                                                                                                   |
 | 1441 | [Build An Array With Stack Operation](https://leetcode.com/problems/build-an-array-with-stack-operations)                                            |                                                         [![Java](assets/java.png)](src/BuildAnArrayWithStackOperations.java)                                                         |                                                                                                                                   |
-| 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters)                                                                       |                                                                                                                                                                                      |                                                                                                                                   |
+| 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters)                                                                       |                                                              [![Java](assets/java.png)](src/ConsecutiveCharacters.java)                                                              |                                                                                                                                   |
 | 1450 | [Number of Students Doing Homework at Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)                   |                                                                                                                                                                                      |                                                                                                                                   |
 | 1455 | [Check If Word Occurs as Prefix of any Word in Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |                                                                                                                                                                                      |                                                                                                                                   |
 | 1460 | [Make 2 Arrays Equal by Reversing Sub Arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)                           |                                                                                                                                                                                      |                                                                                                                                   |

src/ConsecutiveCharacters.java

@@ -0,0 +1,15 @@
+public class ConsecutiveCharacters {
+    public int maxPower(String s) {
+        int power = 1;
+        char current = s.charAt(0);
+        for (int index = 1, frequency = 1 ; index < s.length() ; index++) {
+            if (s.charAt(index) == current) frequency++;
+            else {
+                current = s.charAt(index);
+                frequency = 1;
+            }
+            power = Math.max(power, frequency);
+        }
+        return power;
+    }
+}