make checkstyle happy

Author: fishercoder1534

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

@@ -1,5 +1,9 @@
 package com.fishercoder.solutions;
-/**Write a function to find the longest common prefix string amongst an array of strings.*/
+
+/**
+ * Write a function to find the longest common prefix string amongst an array of strings.
+ */
+
 public class _14 {
 
     public static String longestCommonPrefix(String[] strs) {

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

@@ -22,8 +22,7 @@ public int maxEnvelopes(int[][] envelopes) {
                 || envelopes[0].length == 0 || envelopes[0].length != 2) {
             return 0;
         }
-        Arrays.sort(envelopes, (int[] a, int[] b) ->
-                {
+        Arrays.sort(envelopes, (int[] a, int[] b) -> {
                     if (a[0] == b[0]) {
                         return b[1] - a[1];
                     } else {

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

@@ -1,11 +1,14 @@
 package com.fishercoder.solutions;
+
 /**
  * 67. Add Binary
- 	Given two binary strings, return their sum (also a binary string).
-	For example,
-	a = "11"
-	b = "1"
-	Return "100".*/
+ * Given two binary strings, return their sum (also a binary string).
+ * For example,
+ * a = "11"
+ * b = "1"
+ * Return "100".
+ */
+
 public class _67 {
     //then I turned to Discuss, this post is concise: https://discuss.leetcode.com/topic/13698/short-ac-solution-in-java-with-explanation
     //Tricks and things learned that could be learned: