Java_Man_China的博客

https://leetcode-cn.com/problems/linked-list-cycle/import scala.collection.mutable.HashSetobject Solution { /** * 哈希表法 */ def hasCycle(head: ListNode): Boolean = { if(head == null || head.next == null){ false }else{

https://leetcode-cn.com/problems/reverse-linked-list/object Solution { /** * 非递归方式 */ def reverseList(head: ListNode): ListNode = { if(head == null || head.next == null){ head }else{ var prev = head

object Solution { /** * 暴力遍历求解 */ def middleNode(head: ListNode): ListNode = { val len = getLength(head) var cur = head for(i<-0 until(len/2)){ cur = cur.next } cur } def getLe

object Solution { def removeNthFromEnd(head: ListNode, n: Int): ListNode = { val len = getLength(head) if(len == 0){ //链表为空 head }else{ val preHead = new ListNode(-1,head) var cur = preHead

https://leetcode-cn.com/problems/merge-two-sorted-lists///合并2个有序链表object Solution { /** * 暴力遍历，时间复杂度O(M+N),空间复杂度O(1) */ def mergeTwoLists(l1: ListNode, l2: ListNode): ListNode = { val prevHead = new ListNode(-1) var prev =