源代碼：https://gitee.com/shentuzhigang/mini-project/tree/master/test-string-function

測試代碼

package io.shentuzhigang.test.stringfunction;import org.junit.Test;import static org.junit.Assert.*;public class StringFunctionTest {@Test(timeout = 4000)public void test() {// 判斷是不是回文字符串boolean b1 = StringFunction.isPalindromeInPlace("abc");assertFalse(b1);boolean b2 = StringFunction.isPalindromeInPlace("aba");assertTrue(b2);// 獲取子字符串集合String[] strings = StringFunction.generateSubsets("12");assertArrayEquals(new String[]{"", "2", "1", "21" }, strings);// 萊文斯坦距離int i = StringFunction.levenshteinDistanceIterative("abc", "a");assertEquals(2, i);int j = StringFunction.levenshteinDistanceRecursive("abc", "a");assertEquals(2, j);// 翻轉字符串String s0 = StringFunction.reverseWordsInPlace("");assertEquals("", s0);String s1 = StringFunction.reverseWordsInPlace("abc123");assertEquals("abc123", s1);String s2 = StringFunction.reverseWordsInPlace("abc 1234");assertEquals("1234 abc", s2);String s3 = StringFunction.reverseWordsInPlace("abcd 123 efg");assertEquals("efg 123 abcd", s3);// 翻轉字符串String s4 = StringFunction.reverseWordsByCharWithAdditionalStorage("abcd 123");assertEquals("123 abcd", s4);String s5 = StringFunction.reverseWordsByCharWithAdditionalStorage("abcd 123 efg");assertEquals("efg 123 abcd", s5);}/*** 獲取最長回文子序列*/@Test(timeout = 4000)public void test1() {Manacher.getLongestPalindromicSubstring(null);Manacher.getLongestPalindromicSubstring("");Manacher.getLongestPalindromicSubstring("abc123");Manacher.getLongestPalindromicSubstring("abc 123");Manacher.getLongestPalindromicSubstring("abc1234");Manacher.getLongestPalindromicSubstring("aba1221");} }

測試結果

參考文章

總結

以上是生活随笔為你收集整理的软件测试——StringFunction测试的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。