161. One Edit Distance
2017-08-09 00:00
411 查看
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) { if(s == null || t == null){ return false; } if(s.length() == 0 && t.length() == 0){ return false; } int m = s.length(); int n = t.length(); if(m<n){ // make sure s的长度永远大于t String tmp = ""; tmp = s; s = t; t = tmp; } int diff = Math.abs(m-n); if (diff > 1) { return false; } else if (diff == 1) { for (int i = 0; i < t.length(); i++) { if (s.charAt(i) != t.charAt(i)) { return s.substring(i + 1).equals(t.substring(i)); } } return true; //这是为了处理t为空的情况 } else { for (int i = 0; i < t.length(); i++) { if (s.charAt(i) != t.charAt(i)) { return s.substring(i + 1).equals(t.substring(i + 1)); } } } return false; } }
相关文章推荐
- 161. One Edit Distance
- 1st round, 161 One Edit Distance
- 161. One Edit Distance
- LeetCode 161: One Edit Distance
- leetcode 161: One Edit Distance
- [LeetCode161] One Edit Distance
- 161. One Edit Distance
- 161. One Edit Distance
- 161. One Edit Distance
- [LeetCode#161] One Edit Distance
- leetcode[161] One Edit Distance
- leetcode[161] One Edit Distance
- 161. One Edit Distance
- LeetCode-One Edit Distance
- [LeetCode]One Edit Distance
- LeetCode One Edit Distance
- one edit distance python
- One_Edit_Distance
- One Edit Distance
- one edit distance