enable LeftCurly check

Author: fishercoder1534

fishercoder_checkstyle.xml

@@ -65,10 +65,13 @@
             <property name="option" value="TEXT"/>
             <property name="tokens" value="LITERAL_TRY, LITERAL_FINALLY, LITERAL_IF, LITERAL_ELSE, LITERAL_SWITCH"/>
         module>
+
         
-        
-        
-        
+
+        <module name="LeftCurly">
+            <property name="maxLineLength" value="100"/>
+        module>
+
         <module name="RightCurly"/>
         <module name="RightCurly">
             <property name="option" value="alone"/>
@@ -157,14 +160,16 @@
             
                      
         
-        
+
+        
+            
+            
+            
+            
+            
+            
+        
+
         <module name="AbbreviationAsWordInName">
             <property name="ignoreFinal" value="false"/>
             <property name="allowedAbbreviationLength" value="10"/>

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

@@ -41,9 +41,9 @@ public int maxPoints(Point[] points) {
                             }
                         }
                     } else
-                        for (int k = 0; (k < points.length); k++)
-						/*
-						 * Here, I must put the judgment (k!=i) && (k!=j) in the
+                        for (int k = 0; (k < points.length); k++) {
+                        /*
+                         * Here, I must put the judgment (k!=i) && (k!=j) in the
 						 * if statement instead of in the for, otherwise, when k
 						 * equals i or j, it will stop traversing the rest of
 						 * the points that k represents!
@@ -53,7 +53,6 @@ public int maxPoints(Point[] points) {
 						 *
 						 * It took me an hour and couldn't find any clue!
 						 */
-                        {
                             if ((k != i) && (k != j)) {
                                 if (((points[k].x == points[i].x) && (points[k].y == points[i].y))) {
                                     maxPoints[i][j]++;

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

@@ -37,8 +37,7 @@ public int findMinArrowShots(int[][] points) {
         Arrays.sort(points, (p1, p2) -> Integer.compare(p1[1],p2[1]));
         int currentEnd = points[0][1];
         int count = 1;
-        for(int[] p: points)
-        {
+        for(int[] p: points) {
             // if the point starts after currentEnd, it means this balloons not been bursted. Then we shot the balloon in its end point. Otherwise, means this balloon has been bursted, then ignore it.
             if(p[0]>currentEnd) {
                 count++;

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

@@ -8,8 +8,7 @@ public class _50 {
     public double myPow(double x, int n) {
         if(n == 0)
             return 1;
-        if( n == Integer.MIN_VALUE)
-        {
+        if( n == Integer.MIN_VALUE) {
             ++n;
             n = -n;
             x = 1/x;

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

@@ -20,29 +20,26 @@ public int[][] generateMatrix(int num) {
         int[][] fourEdges = new int[num][num];
         int  value = 1;
         int i = 0, j = 0;
-        if(num%2 == 0)//when num is even
-        {
-            while(i < num/2 && j < num/2 && temp >= 0)
-            {
+        if(num%2 == 0) {//when num is even
+            while(i < num/2 && j < num/2 && temp >= 0) {
 				/* Assign the top row */
-                while(j < temp)
-                {
+                while(j < temp) {
                     fourEdges[i][j] = value;
                     j++;
                     value++;
 
                 }
 
 				/* Assign the right column */
-                while(i < temp - 1){
+                while(i < temp - 1) {
                     i++;
                     fourEdges[i][j - 1] = value;
                     value++;
                 }
                 j = j - 2;
 
 				/* Assign the bottom row */
-                while(j >= num - temp){
+                while(j >= num - temp) {
                     fourEdges[i][j] = value;
                     j--;
                     value++;
@@ -51,7 +48,7 @@ public int[][] generateMatrix(int num) {
                 j++;
 
 				/* Assign the left column */
-                while(i > num - temp){
+                while(i > num - temp) {
                     fourEdges[i][j] = value;
                     i--;
                     value++;
@@ -65,8 +62,7 @@ public int[][] generateMatrix(int num) {
         } else {//when num is odd
             while(i < num/2 && j < num/2 && temp >= 0) {
 				/* Assign the top row */
-                while(j < temp)
-                {
+                while(j < temp) {
                     fourEdges[i][j] = value;
                     j++;
                     value++;