Reverse linked List-Sword point offer

Source: Internet
Author: User

Reverse Linked list Title description

Enter a list of all the elements of the linked list after the list is reversed.

    1. To flip a linked list, you need a node next to point to his previous node, which will lose the next node (one-way list), we need to advance with a pointer to save his next node, and then change the next point.
/*public class ListNode {int val; ListNode next = null; ListNode (int val) {this.val = val; }}*/public class Solution {public ListNode reverselist (ListNode head) {ListNode reversehead = null; ListNode node = head; ListNode nodepre = null;while (node != null) {ListNode Nodenext = node. next;if (Nodenext = null) {Reversehead = nodenode ;node = Nodenext;} return reversehead; }}

Reverse List-Sword point offer

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.