FilesExpand file tree

 master

/

oneEditDistance.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (25 loc) · 1.53 KB

 master

/

oneEditDistance.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (25 loc) · 1.53 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// Given two strings S and T, determine if they are both one edit distance apart.

public class Solution {

public boolean isOneEditDistance(String s, String t) {

//iterate through the length of the smaller string

for(int i = 0; i < Math.min(s.length(), t.length()); i++) {

//if the current characters of the two strings are not equal

if(s.charAt(i) != t.charAt(i)) {

//return true if the remainder of the two strings are equal, false otherwise

if(s.length() == t.length()) {

return s.substring(i + 1).equals(t.substring(i + 1));

}

//return true if the strings would be the same if you deleted a character from string t

else if(s.length() < t.length()) {

return s.substring(i).equals(t.substring(i + 1));

}

//return true if the strings would be the same if you deleted a character from string s

else {

return t.substring(i).equals(s.substring(i + 1));

}

}

}

//if all characters match for the length of the two strings check if the two strings' lengths do not differ by more than 1

return Math.abs(s.length() - t.length()) == 1;

}

}