Merge branch 'master' of https://github.com/javadev/leetcode-in-java

Author: javadev

src/main/java/s0001.two.sum/Solution.java

@@ -21,7 +21,7 @@ public int[] twoSum(int[] nums, int target) {
                 left++;
             }
         }
-        
+
         for (int i = 0; i < nums.length; i++) {
             if (nums1[left] == nums[i]) {
                 result[0] = i;
@@ -34,7 +34,7 @@ public int[] twoSum(int[] nums, int target) {
                 break;
             }
         }
-        
+
         int tmp = result[0];
         result[0] = Math.min(result[0], result[1]);
         result[1] = Math.max(tmp, result[1]);

src/main/java/s0002.add.two.numbers/ListNode.java

@@ -3,6 +3,7 @@
 public class ListNode {
     int val;
     ListNode next;
+
     ListNode(int x) {
         val = x;
     }

src/main/java/s0002.add.two.numbers/Solution.java

@@ -1,12 +1,8 @@
 package s0002.add.two.numbers;
 
 /**
- * Definition for singly-linked list.
- * public class ListNode {
- *     int val;
- *     ListNode next;
- *     ListNode(int x) { val = x; }
- * }
+ * Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int
+ * x) { val = x; } }
  */
 public class Solution {
     public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

src/main/java/s0003.longest.substring.without.repeating.characters/Solution.java

@@ -3,10 +3,10 @@
 public class Solution {
     public int lengthOfLongestSubstring(String s) {
         int lastIndices[] = new int[256];
-        for (int i = 0; i<256; i++) {
+        for (int i = 0; i < 256; i++) {
             lastIndices[i] = -1;
         }
-        
+
         int maxLen = 0;
         int curLen = 0;
         int start = 0;
@@ -22,13 +22,13 @@ public int lengthOfLongestSubstring(String s) {
                 curLen = i - start + 1;
                 lastIndices[cur] = i;
             }
-            
+
             if (curLen > maxLen) {
                 maxLen = curLen;
                 bestStart = start;
             }
         }
-        
+
         return maxLen;
     }
 }

src/main/java/s0004.median.of.two.sorted.arrays/Solution.java

@@ -6,18 +6,14 @@
 
 public class Solution {
     public double findMedianSortedArrays(int[] nums1, int[] nums2) {
-        List<Integer> l=new ArrayList<Integer>();
+        List<Integer> l = new ArrayList<Integer>();
         double f;
-        for(int i=0;i<nums1.length;i++) 
-            l.add(nums1[i]);
-        for(int j=0;j<nums2.length;j++)
-               l.add(nums2[j]);
+        for (int i = 0; i < nums1.length; i++) l.add(nums1[i]);
+        for (int j = 0; j < nums2.length; j++) l.add(nums2[j]);
         Collections.sort(l);
-        int k=l.size();
-        if(k%2==0)
-           f=(double)((l.get(k/2-1))+(l.get(k/2)))/2;
-        else 
-            f = l.get(((k + 1) / 2)-1);
+        int k = l.size();
+        if (k % 2 == 0) f = (double) ((l.get(k / 2 - 1)) + (l.get(k / 2))) / 2;
+        else f = l.get(((k + 1) / 2) - 1);
         return f;
     }
 }

src/main/java/s0005.longest.palindromic.substring/Solution.java

@@ -5,7 +5,8 @@ public String longestPalindrome(String s) {
         int start = 0, end = 0;
         char[] cs = s.toCharArray();
         for (int i = 0, max = 0, prev = 0; i < cs.length; ++i) {
-            if (i - max - 1 >= 0 && cs[i - max - 1] == cs[i]
+            if (i - max - 1 >= 0
+                    && cs[i - max - 1] == cs[i]
                     && (prev == i - 1 || isPalindrome(cs, i - max, i))) {
                 start = i - max - 1;
                 end = i + 1;

src/main/java/s0006.zigzag.conversion/Solution.java

@@ -2,19 +2,19 @@
 
 public class Solution {
     public String convert(String s, int numRows) {
-        if(s==null||s.length()<=numRows||numRows==1) return s;
+        if (s == null || s.length() <= numRows || numRows == 1) return s;
         char letters[] = new char[s.length()];
-        for(int i=0,k=0;i<numRows;i++){
-            if(i==0||i==numRows-1){
-                for(int j=i;j<s.length();j+=2*numRows-2){
-                    letters[k++]=s.charAt(j);
+        for (int i = 0, k = 0; i < numRows; i++) {
+            if (i == 0 || i == numRows - 1) {
+                for (int j = i; j < s.length(); j += 2 * numRows - 2) {
+                    letters[k++] = s.charAt(j);
                 }
                 continue;
             }
-            letters[k++]=s.charAt(i);
-            for(int j=2*numRows-2-i;j<s.length();j+=2*numRows-2){
-                    letters[k++]=s.charAt(j);
-                    if(j+2*i<s.length()) letters[k++]=s.charAt(j+2*i);
+            letters[k++] = s.charAt(i);
+            for (int j = 2 * numRows - 2 - i; j < s.length(); j += 2 * numRows - 2) {
+                letters[k++] = s.charAt(j);
+                if (j + 2 * i < s.length()) letters[k++] = s.charAt(j + 2 * i);
             }
         }
         return new String(letters);

src/main/java/s0007.reverse.integer/Solution.java

@@ -2,7 +2,7 @@
 
 public class Solution {
     public int reverse(int x) {
-        long rev = 0; 
+        long rev = 0;
         while (x != 0) {
             rev = (rev * 10) + (x % 10);
             x /= 10;

src/main/java/s0008.string.to.integer.atoi/Solution.java

@@ -2,15 +2,14 @@
 
 public class Solution {
     public int myAtoi(String str) {
-        if (str == null || str.length() == 0)
-            return 0;
+        if (str == null || str.length() == 0) return 0;
 
         int i = 0;
         boolean negetiveSign = false;
         char[] input = str.toCharArray();
 
         while (i < input.length && input[i] == ' ') {
-            i++;  
+            i++;
         }
 
         if (i == input.length) {
@@ -24,7 +23,7 @@ public int myAtoi(String str) {
 
         int num = 0;
         while (i < input.length && input[i] <= '9' && input[i] >= '0') {
-            int tem = input[i] - '0';  //current char
+            int tem = input[i] - '0'; // current char
             tem = negetiveSign ? -tem : tem;
 
             if (num == 0 && tem == '0') { // avoid invalid number like 038

src/main/java/s0009.palindrome.number/Solution.java

@@ -7,11 +7,10 @@ public boolean isPalindrome(int x) {
         }
         int rev = 0;
         int localX = x;
-        while (localX > 0)
-        {
-          rev *= 10;
-          rev += localX % 10;
-          localX /= 10;
+        while (localX > 0) {
+            rev *= 10;
+            rev += localX % 10;
+            localX /= 10;
         }
         return rev == x;
     }