refactor 161

fishercoder1534 · fishercoder1534 · commit 1b779bf5d4ce · 2021-01-22T07:05:09.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_161.java b/src/main/java/com/fishercoder/solutions/_161.java
@@ -1,31 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 161. One Edit Distance
- *
- * Given two strings s and t, determine if they are both one edit distance apart.
- *
- * Note:
- * There are 3 possiblities to satisify one edit distance apart:
- * Insert a character into s to get t
- * Delete a character from s to get t
- * Replace a character of s to get t
- *
- * Example 1:
- * Input: s = "ab", t = "acb"
- * Output: true
- * Explanation: We can insert 'c' into s to get t.
- *
- * Example 2:
- * Input: s = "cab", t = "ad"
- * Output: false
- * Explanation: We cannot get t from s by only one step.
- *
- * Example 3:
- * Input: s = "1203", t = "1213"
- * Output: true
- * Explanation: We can replace '0' with '1' to get t.
- */
 public class _161 {
     public static class Solution1 {
         public boolean isOneEditDistance(String s, String t) {
@@ -48,9 +22,8 @@ public boolean isOneEditDistance(String s, String t) {
                         j++;
                     }
                 }
-                return diffCnt == 1
-                        || diffCnt
-                        == 0;//it could be the last char of the longer is the different one, in that case, diffCnt remains to be zero
+                return diffCnt == 1 || diffCnt == 0;
+                //it could be the last char of the longer is the different one, in that case, diffCnt remains to be zero
             } else if (s.length() == t.length()) {
                 int diffCnt = 0;
                 for (int i = 0; i < s.length(); i++) {
