剑指offer-问题16

package offer;

/**
 * offer interview 16
 */
public class Test16 {

    public static class ListNode{
        int value;
        ListNode next;

        public ListNode(){
        }

        public ListNode(int value){
            this.value = value;
            this.next = null;
        }

    }


    //method 1
    public static ListNode reverseList(ListNode head){
        ListNode root = new ListNode();
        root.next = null;

        ListNode next;

        while (head != null){
            next = head.next;

            head.next = root.next;
            root.next = head;

            head = next;
        }

        return root.next;

    }

    //method 2
    public static ListNode reverseList2(ListNode head){
        ListNode reverseHead = null;
        ListNode curr = head;
        ListNode prev = null;
        ListNode next;

        while (curr != null){
            reverseHead = curr;
            next = curr.next;

            curr.next = prev;
            prev = curr;
            curr = next;
        }

        return reverseHead;
    }


    public static void printList(ListNode head){
        while (head != null){
            System.out.print(head.value + "->");
            head =  head.next;
        }
        System.out.println("null");
    }

    public static void main(String[] args){
        ListNode head = new ListNode(1);
        head.next = new ListNode(2);
        head.next.next = new ListNode(3);
        head.next.next.next = new ListNode(4);
        head.next.next.next.next = new ListNode(5);
        head.next.next.next.next.next = new ListNode(6);
        head.next.next.next.next.next.next = new ListNode(7);
        head.next.next.next.next.next.next.next = new ListNode(8);
        head.next.next.next.next.next.next.next.next = new ListNode(9);

        printList(head);
        head = reverseList(head);
        printList(head);

        System.out.println("========");
        head = reverseList2(head);
        printList(head);
    }

}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值