leetcode-java/src/OneEditDistance161.java at master · fluency03/leetcode-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/**
 * 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 OneEditDistance161 {
    public boolean isOneEditDistance(String s, String t) {
        int lens = s.length();
        int lent = t.length();
        if (Math.abs(lens - lent) > 1) return false;
        if (lens > lent) {
            return isOneDelete(s, t);
        } else if (lent > lens) {
            return isOneDelete(t, s);
        } else {
            return isOneReplace(s, t);
        }
    }

    private boolean isOneReplace(String s, String t) {
        int diff = 0;
        char[] charss = s.toCharArray();
        char[] charst = t.toCharArray();

        for (int i=0; i<charss.length; i++) {
            if (charss[i] != charst[i]) {
                diff++;
                if (diff > 1) return false;
            }
        }

        return diff == 1;
    }

    private boolean isOneDelete(String longStr, String shortStr) {
        char[] charsl = longStr.toCharArray();
        char[] charss = shortStr.toCharArray();

        int l = 0;
        int s = 0;
        int diff = 0;
        while (s < charss.length && l < charsl.length) {
            if (charss[s] != charsl[l]) {
                diff++;
                if (diff > 1) return false;
                l++;
            } else {
                s++;
                l++;
            }
        }

        return ((l - s) == 1 && diff == 1) || (s == l && diff == 0);
    }


    public boolean isOneEditDistance2(String s, String t) {
        if (s == null || t == null || Math.abs(s.length() - t.length()) >= 2) return false;

        char[] cs = s.toCharArray();
        int lenS = s.length();
        char[] ct = t.toCharArray();
        int lenT = t.length();

        int i = 0;
        int j = 0;
        while (i < lenS && j < lenT) {
            if (cs[i] == ct[j]) {
                i++;
                j++;
                continue;
            }
            return isSame(cs, i+1, lenS, ct, j+1, lenT) || isSame(cs, i+1, lenS, ct, j, lenT) || isSame(cs, i, lenS, ct, j+1, lenT);
        }

        return Math.abs(lenS - lenT) == 1;
    }

    private boolean isSame(char[] cs, int i, int lenS, char[] ct, int j, int lenT) {
        if (i == lenS && j == lenT) return true;
        if (i == lenS || j == lenT) return false;

        while (i < lenS && j < lenT) {
            if (cs[i++] != ct[j++]) return false;
        }
        return i == lenS && j == lenT;
    }

}