[英]How to find common suffix using recursion in java
因此,我在Stack Overflow上看到,可以使用不使用遞歸的方法派生通用后綴。 我很好奇能否通過遞歸實現相同的目標。 嘗試使用下面的代碼,但得到java.lang.StackOverflowError。 有人可以幫忙嗎?
public static String commonSuffixWithRecursion(String s1, String s2) {
if(s1.length()==0 || s2.length()==0) {
return "Strings are empty";
}
if(s1.charAt(s1.length()-1)==s2.charAt(s2.length()-1)) {
return s1.length()-1 + commonSuffixWithRecursion(s1,s2);
}
return "No common Suffix";
}
沒有通用后綴時,應返回空字符串。
您可以使用subString
獲取下一輪的輸入
目前焦炭下一步應該rount的結果后追加
樣例代碼:
public static String commonSuffixWithRecursion(String s1, String s2) {
if (s1.length() == 0 || s2.length() == 0) {
return "";
}
if (s1.charAt(s1.length() - 1) == s2.charAt(s2.length() - 1)) {
String nextS1 = s1.substring(0, s1.length() - 1);
String nextS2 = s2.substring(0, s2.length() - 1);
return commonSuffixWithRecursion(nextS1, nextS2 ) + s1.charAt(s1.length() - 1);
}
return "";
}
測試用例:
public static void main(String[] args) {
System.out.println(commonSuffixWithRecursion("dbc", "abc")); // bc
System.out.println(commonSuffixWithRecursion("a", "a")); // a
System.out.println(commonSuffixWithRecursion("ab", "b")); // b
System.out.println(commonSuffixWithRecursion("a", "b")); // empty
}
遞歸執行的一種簡單方法是
public static String commonSuffixWithRecursion(String x, String y, int m, int n) {
if(m <= 0 || n <= 0)
return "";
if (x.charAt(m-1) == y.charAt(n-1))
return commonSuffixWithRecursion(x, y, m-1, n-1) + x.charAt(m-1);
else
return "";
}
這里m=x.length() and n=y.length()
這是使用增加的后綴大小的另一個選項:
public static String commonSuffixWithRecursion(String s1, String s2, int suffixSize) {
int i1 = s1.length() - suffixSize;
int i2 = s2.length() - suffixSize;
if (i1 > -1 && i2 > -1 && s1.charAt(i1) == s2.charAt(i2)) {
return commonSuffixWithRecursion(s1, s2, suffixSize + 1);
}
return s1.substring(i1 + 1);
}
以下是一些測試案例:
public static void main(String[] args) {
System.out.println(commonSuffixWithRecursion("dbc", "abc", 1)); // bc
System.out.println(commonSuffixWithRecursion("a", "a", 1)); // a
System.out.println(commonSuffixWithRecursion("ab", "b", 1)); // b
System.out.println(commonSuffixWithRecursion("a", "b", 1)); // empty
System.out.println(commonSuffixWithRecursion("a", "bc", 1)); // empty
System.out.println(commonSuffixWithRecursion("ac", "bc", 1)); // c
System.out.println(commonSuffixWithRecursion("ac", "bcd", 1)); // empty
System.out.println(commonSuffixWithRecursion("", "bcd", 1)); // empty
System.out.println(commonSuffixWithRecursion("bcd", "bcd", 1)); // bcd
}
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.