LeetCode String 161 One Edit Distance

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.

solution:

首先遍历两个string找到，出现不同的地方。然后分情况判断。

    public boolean isOneEditDistance(String s, String t) {
        if (s.length() == 0 && t.length()==0) return false;
        int a = s.length();
        int b = t.length();
        if (Math.abs(a-b) > 1) return false;
        if (a > b) return isOneEditDistance(t,s);
        for (int i = 0; i < a; i++) {
            if (s.charAt(i) != t.charAt(i)) {
                if (a==b) return s.substring(i+1).equals(t.substring(i+1));
                else return s.substring(i).equals(t.substring(i+1));
            }
        }
        return b-a == 1;
    }