算法与数据结构

算法与数据结构

第二天打卡

1.合并两个有序链表

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        //创建一个新的链表节点
        ListNode head=new ListNode(0);
        ListNode prev=head;
        while(l1!=null&&l2!=null){
            if(l1.val<=l2.val){
                prev.next=l1;
                l1=l1.next;
            }else{
                prev.next=l2;
                l2=l2.next;
            }
            prev=prev.next;
        }
        prev.next=l1==null?l2:l1;
        return head.next;
    }

2.删除链表的倒数第N个节点

 public ListNode removeNthFromEnd(ListNode head, int n) {
        int count=0;
        ListNode prev=new ListNode(0);
        prev.next=head;
        ListNode curr=prev;
        while(head!=null){
            count++;
            head=head.next;
        }
        count=count-n;
        //curr=prev;
        while(count>0){
           curr=curr.next;
            count--;
        }
        curr.next=curr.next.next;
        return prev.next;
    }

3.旋转链表

public ListNode rotateRight(ListNode head, int k) {
        if(head==null||head.next==null){
            return head;
        }
        ListNode dummy=new ListNode(0);
        ListNode curr=dummy;
        ListNode prev=head;
        int count=0;
        while(head!=null){
            count++;
            head=head.next;
        }
        k=k%count;
        int a=count-k;
        while(a>0){
            curr.next=prev;
            curr=prev;
            prev=prev.next;
            a--;
        }
        curr.next=null;
        ListNode dummy1=new ListNode(0);
        ListNode curr1=dummy1;
        while(k>0){
            curr1.next=prev;
            curr1=prev;
            prev=prev.next;
            k--;
        }
        curr1.next=dummy.next;
        return dummy1.next;
    }