6链表相关面试题

快慢指针

输入链表头节点，奇数长度返回中点，偶数长度返回上中点

输入链表头节点，奇数长度返回中点，偶数长度返回下中点

输入链表头节点，奇数长度返回中点前一个，偶数长度返回上中点前一个

输入链表头节点，奇数长度返回中点前一个，偶数长度返回下中点前一个

public static Node midOrUpMidNode(Node head) {
		if (head == null || head.next == null ) {
			return head;
		}
		// 链表有2个点或以上
		Node slow = head;
		Node fast = head;
		while (fast.next != null && fast.next.next != null) {
			slow = slow.next;
			fast = fast.next.next;
		}
		return slow;
	}

	public static Node midOrDownMidNode(Node head) {
		if (head == null || head.next == null) {
			return head;
		}
		Node slow = head.next;
		Node fast = head.next;
		while (fast.next != null && fast.next.next != null) {
			slow = slow.next;
			fast = fast.next.next;
		}
		return slow;
	}

	public static Node midOrUpMidPreNode(Node head) {
		if (head == null || head.next == null || head.next.next == null) {
			return null;
		}
		Node slow = head;
		Node fast = head.next.next;
		while (fast.next != null && fast.next.next != null) {
			slow = slow.next;
			fast = fast.next.next;
		}
		return slow;
	}

	public static Node midOrDownMidPreNode(Node head) {
		if (head == null || head.next == null) {
			return null;
		}
		if (head.next.next == null) {
			return head;
		}
		Node slow = head;
		Node fast = head.next;
		while (fast.next != null && fast.next.next != null) {
			slow = slow.next;
			fast = fast.next.next;
		}
		return slow;
	}

public static Node right1(Node head) {
		if (head == null) {
			return null;
		}
		Node cur = head;
		ArrayList<Node> arr = new ArrayList<>();
		while (cur != null) {
			arr.add(cur);
			cur = cur.next;
		}
		return arr.get((arr.size() - 1) / 2);
	}

	public static Node right2(Node head) {
		if (head == null) {
			return null;
		}
		Node cur = head;
		ArrayList<Node> arr = new ArrayList<>();
		while (cur != null) {
			arr.add(cur);
			cur = cur.next;
		}
		return arr.get(arr.size() / 2);
	}

	public static Node right3(Node head) {
		if (head == null || head.next == null || head.next.next == null) {
			return null;
		}
		Node cur = head;
		ArrayList<Node> arr = new ArrayList<>();
		while (cur != null) {
			arr.add(cur);
			cur = cur.next;
		}
		return arr.get((arr.size() - 3) / 2);
	}

	public static Node right4(Node head) {
		if (head == null || head.next == null) {
			return null;
		}
		Node cur = head;
		ArrayList<Node> arr = new ArrayList<>();
		while (cur != null) {
			arr.add(cur);
			cur = cur.next;
		}
		return arr.get((arr.size() - 2) / 2);
	}

• 给定一个单链表的头节点head，判断该链表是否为回文结构

// need n extra space
	public static boolean isPalindrome1(Node head) {
		Stack<Node> stack = new Stack<Node>();
		Node cur = head;
		while (cur != null) {
			stack.push(cur);
			cur = cur.next;
		}
		while (head != null) {
			if (head.value != stack.pop().value) {
				return false;
			}
			head = head.next;
		}
		return true;
	}

	// need n/2 extra space
	public static boolean isPalindrome2(Node head) {
		if (head == null || head.next == null) {
			return true;
		}
		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;
		while (n2.next != null && n2.next.next != null) { // find mid node
			n1 = n1.next; // n1 -> mid
			n2 = n2.next.next; // n2 -> end
		}
		// n1 中点
		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
			n2.next = n1; // next of right node convert
			n1 = n2; // n1 move
			n2 = n3; // n2 move
		}
		n3 = n1; // n3 -> save last node
		n2 = head;// n2 -> left first node
		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 Node listPartition1(Node head, int pivot) {
		if (head == null) {
			return head;
		}
		Node cur = head;
		int i = 0;
		while (cur != null) {
			i++;
			cur = cur.next;
		}
		Node[] nodeArr = new Node[i];
		i = 0;
		cur = head;
		for (i = 0; i != nodeArr.length; i++) {
			nodeArr[i] = cur;
			cur = cur.next;
		}
		arrPartition(nodeArr, pivot);
		for (i = 1; i != nodeArr.length; i++) {
			nodeArr[i - 1].next = nodeArr[i];
		}
		nodeArr[i - 1].next = null;
		return nodeArr[0];
	}

	public static void arrPartition(Node[] nodeArr, int pivot) {
		int small = -1;
		int big = nodeArr.length;
		int index = 0;
		while (index != big) {
			if (nodeArr[index].value < pivot) {
				swap(nodeArr, ++small, index++);
			} else if (nodeArr[index].value == pivot) {
				index++;
			} else {
				swap(nodeArr, --big, index);
			}
		}
	}

	public static void swap(Node[] nodeArr, int a, int b) {
		Node tmp = nodeArr[a];
		nodeArr[a] = nodeArr[b];
		nodeArr[b] = tmp;
	}

public static Node listPartition2(Node head, int pivot) {
		Node sH = null; // small head
		Node sT = null; // small tail
		Node eH = null; // equal head
		Node eT = null; // equal tail
		Node mH = null; // big head
		Node mT = null; // big tail
		Node next = null; // save next node
		// every node distributed to three lists
		while (head != null) {
			next = head.next;
			head.next = null;
			if (head.value < pivot) {
				if (sH == null) {
					sH = head;
					sT = head;
				} else {
					sT.next = head;
					sT = head;
				}
			} else if (head.value == pivot) {
				if (eH == null) {
					eH = head;
					eT = head;
				} else {
					eT.next = head;
					eT = head;
				}
			} else {
				if (mH == null) {
					mH = head;
					mT = head;
				} else {
					mT.next = head;
					mT = head;
				}
			}
			head = next;
		}
		// 小于区域的尾巴，连等于区域的头，等于区域的尾巴连大于区域的头
		if (sT != null) { // 如果有小于区域
			sT.next = eH;
			eT = eT == null ? sT : eT; // 下一步，谁去连大于区域的头，谁就变成eT
		}
		// 上面的if，不管跑了没有，et
		// all reconnect
		if (eT != null) { // 如果小于区域和等于区域，不是都没有
			eT.next = mH;
		}
		return sH != null ? sH : (eH != null ? eH : mH);
	}

• 单链表节点结构增加rand指针，随机指向一个节点，可能指向null，给定一个由这种节点类型组成的无环单链表的头节点，实现链表的复制

  public static class Node {
  		public int value;
  		public Node next;
  		public Node rand;
  
  		public Node(int data) {
  			this.value = data;
  		}
  	}
  
  	public static Node copyListWithRand1(Node head) {
  		HashMap<Node, Node> map = new HashMap<Node, Node>();
  		Node cur = head;
  		while (cur != null) {
  			map.put(cur, new Node(cur.value));
  			cur = cur.next;
  		}
  		cur = head;
  		while (cur != null) {
  			// cur 老
  			// map.get(cur) 新
  			map.get(cur).next = map.get(cur.next);
  			map.get(cur).rand = map.get(cur.rand);
  			cur = cur.next;
  		}
  		return map.get(head);
  	}
  
  	public static Node copyListWithRand2(Node head) {
  		if (head == null) {
  			return null;
  		}
  		Node cur = head;
  		Node next = null;
  		// copy node and link to every node
  		// 1 -> 2
  		// 1 -> 1' -> 2
  		while (cur != null) {
  			// cur 老   next 老的下一个
  			next = cur.next;
  			cur.next = new Node(cur.value);
  			cur.next.next = next;
  			cur = next;
  		}
  		cur = head;
  		Node curCopy = null;
  		// set copy node rand
  		// 1 -> 1' -> 2 -> 2'
  		while (cur != null) {
  			// cur 老
  			// cur.next  新 copy
  			next = cur.next.next;
  			curCopy = cur.next;
  			curCopy.rand = cur.rand != null ? cur.rand.next : null;
  			cur = next;
  		}
  		// head  head.next
  		Node res = head.next;
  		cur = head;
  		// split
  		while (cur != null) {
  			next = cur.next.next;
  			curCopy = cur.next;
  			cur.next = next;
  			curCopy.next = next != null ? next.next : null;
  			cur = next;
  		}
  		return res;
  	}
  

• 给定两个可能有环的单链表，实现一个函数，如果两个链表相交返回第一个相交节点

  public static Node getIntersectNode(Node head1, Node head2) {
  		if (head1 == null || head2 == null) {
  			return null;
  		}
  		Node loop1 = getLoopNode(head1);
  		Node loop2 = getLoopNode(head2);
  		if (loop1 == null && loop2 == null) {
  			return noLoop(head1, head2);
  		}
  		if (loop1 != null && loop2 != null) {
  			return bothLoop(head1, loop1, head2, loop2);
  		}
  		return null;
  	}
  
  	// 找到链表第一个入环节点，如果无环，返回null
  	public static Node getLoopNode(Node head) {
  		if (head == null || head.next == null || head.next.next == null) {
  			return null;
  		}
  		// n1 慢  n2 快
  		Node n1 = head.next; // n1 -> slow
  		Node n2 = head.next.next; // n2 -> fast
  		while (n1 != n2) {
  			if (n2.next == null || n2.next.next == null) {
  				return null;
  			}
  			n2 = n2.next.next;
  			n1 = n1.next;
  		}
  		n2 = head; // n2 -> walk again from head
  		while (n1 != n2) {
  			n1 = n1.next;
  			n2 = n2.next;
  		}
  		return n1;
  	}
  
  	// 如果两个链表都无环，返回第一个相交节点，如果不想交，返回null
  	public static Node noLoop(Node head1, Node head2) {
  		if (head1 == null || head2 == null) {
  			return null;
  		}
  		Node cur1 = head1;
  		Node cur2 = head2;
  		int n = 0;
  		while (cur1.next != null) {
  			n++;
  			cur1 = cur1.next;
  		}
  		while (cur2.next != null) {
  			n--;
  			cur2 = cur2.next;
  		}
  		if (cur1 != cur2) {
  			return null;
  		}
  		// n  :  链表1长度减去链表2长度的值
  		cur1 = n > 0 ? head1 : head2; // 谁长，谁的头变成cur1
  		cur2 = cur1 == head1 ? head2 : head1; // 谁短，谁的头变成cur2
  		n = Math.abs(n);
  		while (n != 0) {
  			n--;
  			cur1 = cur1.next;
  		}
  		while (cur1 != cur2) {
  			cur1 = cur1.next;
  			cur2 = cur2.next;
  		}
  		return cur1;
  	}
  
  	// 两个有环链表，返回第一个相交节点，如果不想交返回null
  	public static Node bothLoop(Node head1, Node loop1, Node head2, Node loop2) {
  		Node cur1 = null;
  		Node cur2 = null;
  		if (loop1 == loop2) {
  			cur1 = head1;
  			cur2 = head2;
  			int n = 0;
  			while (cur1 != loop1) {
  				n++;
  				cur1 = cur1.next;
  			}
  			while (cur2 != loop2) {
  				n--;
  				cur2 = cur2.next;
  			}
  			cur1 = n > 0 ? head1 : head2;
  			cur2 = cur1 == head1 ? head2 : head1;
  			n = Math.abs(n);
  			while (n != 0) {
  				n--;
  				cur1 = cur1.next;
  			}
  			while (cur1 != cur2) {
  				cur1 = cur1.next;
  				cur2 = cur2.next;
  			}
  			return cur1;
  		} else {
  			cur1 = loop1.next;
  			while (cur1 != loop1) {
  				if (cur1 == loop2) {
  					return loop1;
  				}
  				cur1 = cur1.next;
  			}
  			return null;
  		}
  	}
  

• 能不能不给单链表的头，只给想要删除的节点，就能做到在链表上把该点删除

可以拷贝下一个节点，把下一个节点删除，这么做有很多不足，因为本质上没有删除目标节点