链表——回文链表(快慢指针,栈,反转链表)

//判断链表是否是回文结构
public class IsPalindromeList {

	public static class Node {
		public int value;
		public Node next;

		public Node(int data) {
			this.value = data;
		}
	}

	// need n extra space
	//需要n的额外空间
	public static boolean isPalindrome1(Node head) {
		//堆结构
		Stack<Node> stack = new Stack<Node>();
		//新建cur指向头节点
		Node cur = head;
		//遍历将链表推进堆中
		while (cur != null) {
			stack.push(cur);
			cur = cur.next;
		}
		//遍历头节点依次与stack弹出的值作比较
		while (head != null) {
			if (head.value != stack.pop().value) {
				return false;
			}
			head = head.next;
		}
		return true;
	}

	// need n/2 extra space
	//需要n/2的额外空间
	public static boolean isPalindrome2(Node head) {
		if (head == null || head.next == null) {
			return true;
		}
		//right为慢指针
		//cur为快指针
		Node right = head.next;
		Node cur = head;
		while (cur.next != null && cur.next.next != null) {
			right = right.next;
			cur = cur.next.next;
		}
		Stack<Node> stack = new Stack<Node>();
		//当慢指针不为空,将当前至最后的节点都推入堆中
		while (right != null) {
			stack.push(right);
			right = right.next;
		}
		//比较
		while (!stack.isEmpty()) {
			if (head.value != stack.pop().value) {
				return false;
			}
			head = head.next;
		}
		return true;
	}

	// need O(1) extra space
	//只需要常数级别的额外空间
	public static boolean isPalindrome3(Node head) {
		if (head == null || head.next == null) {
			return true;
		}
		Node n1 = head;
		Node n2 = head;
		//找到中点n1
		while (n2.next != null && n2.next.next != null) { // find mid node
			n1 = n1.next; // n1 -> mid
			n2 = n2.next.next; // n2 -> end
		}
		//修改中点右边的节点指向,使之全部指向中点
		n2 = n1.next; // n2 -> right part first node
		n1.next = null; // mid.next -> null
		Node n3 = null;
		while (n2 != null) { // right part convert
			n3 = n2.next; // n3 -> save next node	n3指定为n2下一位
			n2.next = n1; // next of right node convert		n2下一位修改为n1
			n1 = n2; // n1 move		将n1修改为n2
			n2 = n3; // n2 move		将n2修改为n3
		}

		//从链表头尾两端遍历比较
		n3 = n1; // n3 -> save last node	n3修改为n1保存最后一个节点
		n2 = head;// n2 -> left first node		n2指定为第一个节点
		boolean res = true;
		while (n1 != null && n2 != null) { // check palindrome
			if (n1.value != n2.value) {
				res = false;
				break;
			}
			n1 = n1.next; // left to mid
			n2 = n2.next; // right to mid
		}
		n1 = n3.next;
		n3.next = null;
		//还原链表
		while (n1 != null) { // recover list
			n2 = n1.next;
			n1.next = n3;
			n3 = n1;
			n1 = n2;
		}
		return res;
	}

	public static void printLinkedList(Node node) {
		System.out.print("Linked List: ");
		while (node != null) {
			System.out.print(node.value + " ");
			node = node.next;
		}
		System.out.println();
	}

	public static void main(String[] args) {

		Node head = null;
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		head.next.next = new Node(3);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		head.next.next = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		head.next.next = new Node(3);
		head.next.next.next = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		head.next.next = new Node(2);
		head.next.next.next = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

		head = new Node(1);
		head.next = new Node(2);
		head.next.next = new Node(3);
		head.next.next.next = new Node(2);
		head.next.next.next.next = new Node(1);
		printLinkedList(head);
		System.out.print(isPalindrome1(head) + " | ");
		System.out.print(isPalindrome2(head) + " | ");
		System.out.println(isPalindrome3(head) + " | ");
		printLinkedList(head);
		System.out.println("=========================");

	}

}
  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
在Python中,可以使用快慢指针法来判断一个链表是否为回文链表快慢指针法的思路是,使用两个指针同时从链表的头部出发,快指针每次向后移动两个位置,慢指针每次向后移动一个位置。当快指针到达链表末尾时,慢指针刚好指向链表的中间位置。 具体的实现步骤如下所示: 1. 创建两个指针slow和fast,初始都指向链表的头部。 2. 使用while循环,当fast的下一个节点和下下个节点都不为空时,执行循环体。 - 慢指针slow每次向后移动一个位置,即slow = slow.next。 - 快指针fast每次向后移动两个位置,即fast = fast.next.next。 3. 循环结束后,慢指针slow将指向链表的中间位置。注意,如果链表长度为奇数,slow指向的是正中间的节点;如果链表长度为偶数,slow指向的是后半段的第一个节点。 4. 将中间节点的下一个节点开始的链表进行倒序,可以使用一个辅助函数reverse来实现。reverse函数的作用是将一个链表倒序并返回新的链表头部。 5. 将slow的next指针置为None,即切断链表中间位置的节点与后半段链表的连接。 6. 使用两个指针p和q分别指向原链表的头部和倒序后的链表的头部。然后同时向后遍历这两个链表,比较节点的值是否相等。如果出现不相等的情况,说明链表不是回文链表,返回False。 7. 当遍历结束后,如果q指针为None,说明两个链表长度相等且所有节点的值都相等,返回True;否则,链表不是回文链表,返回False。 下面是使用快慢指针法判断回文链表的Python代码实现: ``` # 是否是回文 def palindrome(head): if head is None: return True slow = fast = head while fast.next is not None and fast.next.next is not None: slow = slow.next fast = fast.next.next mid = slow.next reversed_mid = reverse(mid) slow.next = None p = head q = reversed_mid while p is not None and q is not None: if p.val != q.val: return False p = p.next q = q.next return True # 辅助函数:链表倒序 def reverse(head): if head is None or head.next is None: return head pre = None cur = head while cur is not None: next_node = cur.next cur.next = pre pre = cur cur = next_node return pre ``` 通过以上代码,我们可以使用快慢指针法来判断一个链表是否为回文链表。<span class="em">1</span><span class="em">2</span><span class="em">3</span><span class="em">4</span>
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值