源代码：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");}
}

测试结果

参考文章

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！