二叉树 - 旋转链表

61.js

"use strict";
var _a;
Object.defineProperty(exports, "__esModule", { value: true });
class ListNode {
    constructor(val, next) {
        this.val = (val === undefined ? 0 : val);
        this.next = (next === undefined ? null : next);
    }
}
let head = new ListNode(1, new ListNode(2, new ListNode(3, new ListNode(4, new ListNode(5, null)))));
let clonehead = head;
let p = head === null || head === void 0 ? void 0 : head.next;
while ((_a = head === null || head === void 0 ? void 0 : head.next) === null || _a === void 0 ? void 0 : _a.next) {
    head = head.next;
    p = p.next;
}
head.next = null;
p.next = clonehead;
let a = 1;

61.ts

    
     class ListNode {
     val: number
     next: ListNode | null
      constructor(val?: number, next?: ListNode | null) {
          this.val = (val===undefined ? 0 : val)
          this.next = (next===undefined ? null : next)
      }
  }

        let head=new ListNode(1,new ListNode(2,new ListNode(3,new ListNode(4,new ListNode(5,null)))))

        let clonehead=head
        let p=head?.next as ListNode
        
        while(head?.next?.next){
            head=head.next
            p=p.next as ListNode
        }
        head.next=null
        p.next=clonehead
       


       let a=1

源码地址

• JavaScript
• TypeScript