-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOneEditDistance.java
33 lines (29 loc) · 1.16 KB
/
OneEditDistance.java
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
package solutions;
// [Problem] https://leetcode.com/problems/one-edit-distance
class OneEditDistance {
// String
// O(n) time, O(n) space
public boolean isOneEditDistance(String s, String t) {
int sLength = s.length(), tLength = t.length();
for (int i = 0; i < Math.min(sLength, tLength); i++) {
if (s.charAt(i) != t.charAt(i)) {
if (sLength < tLength) {
return s.substring(i).equals(t.substring(i + 1));
} else if (sLength > tLength) {
return s.substring(i + 1).equals(t.substring(i));
} else {
return s.substring(i + 1).equals(t.substring(i + 1));
}
}
}
return Math.abs(sLength - tLength) == 1;
}
// Test
public static void main(String[] args) {
OneEditDistance solution = new OneEditDistance();
boolean output1 = solution.isOneEditDistance("ab", "acb");
System.out.println("Test 1 passed? " + (output1 == true));
boolean output2 = solution.isOneEditDistance("", "");
System.out.println("Test 2 passed? " + (output2 == false));
}
}