forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request neetcode-gh#1139 from ChrisKheng/scala
Add scala solution for 141-Linked-List-Cycle and 206-Reverse-Linked-List
- Loading branch information
Showing
3 changed files
with
47 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,24 @@ | ||
| /** | ||
| * Definition for singly-linked list. | ||
| * class ListNode(var _x: Int = 0) { | ||
| * var next: ListNode = null | ||
| * var x: Int = _x | ||
| * } | ||
| */ | ||
|
|
||
| object Solution { | ||
| def hasCycle(head: ListNode): Boolean = { | ||
| var (slowPtr, fastPtr) = (head, head) | ||
|
|
||
| while (fastPtr != null && fastPtr.next != null) { | ||
| slowPtr = slowPtr.next | ||
| fastPtr = fastPtr.next.next | ||
|
|
||
| if (slowPtr eq fastPtr) { | ||
| return true | ||
| } | ||
| } | ||
|
|
||
| return false | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,20 @@ | ||
| /** | ||
| * Definition for singly-linked list. | ||
| * class ListNode(_x: Int = 0, _next: ListNode = null) { | ||
| * var next: ListNode = _next | ||
| * var x: Int = _x | ||
| * } | ||
| */ | ||
| object Solution { | ||
| def reverseList(head: ListNode): ListNode = { | ||
| if (head == null || head.next == null) { | ||
| return head | ||
| } | ||
|
|
||
| val reversedListHead = reverseList(head.next) | ||
| head.next.next = head | ||
| head.next = null | ||
|
|
||
| return reversedListHead | ||
| } | ||
| } |