qq_34792830的博客

实现思路：借助两个快慢指针来实现，快指针走两步，慢指针走一步，当快指针到终点时，慢指针刚好到中点，并且在慢指针每走一步中，将其指向方向修改，最后对比前后即可判断是否为回文字符串。public class Palindrome { static class ListNode{ int var; ListNode next; public ListNode(int ...

public class ReverseLink { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String str = scanner.nextLine(); char[] s = str.toCharArray(); NodeList[] n...

public class HaveLoop { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String str = scanner.nextLine(); char[] s = str.toCharArray(); NodeList[] no...

public class MergeLink { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String str1 = scanner.nextLine(); String str2 = scanner.nextLine(); NodeList node...