-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.6_palindrome.rb
74 lines (55 loc) · 1.25 KB
/
2.6_palindrome.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
# frozen_string_literal: true
# Implement a function to check if a linked list is a palindrome.
require_relative '../test_helper'
Node = Struct.new('Node', :value, :next)
class LinkedList
def initialize(head)
@head = head
end
def palindrome?
stack = []
slow = head
fast = head
while fast&.next
stack.append(slow.value)
slow = slow.next
fast = fast.next.next
end
slow = slow.next if fast
while slow
return false if slow.value != stack.pop
slow = slow.next
end
true
end
private
attr_reader :head
end
class TestStringRotate < Minitest::Test
def test_1
i5 = Node.new(0)
i4 = Node.new(1, i5)
i3 = Node.new(2, i4)
i2 = Node.new(2, i3)
i1 = Node.new(1, i2)
i0 = Node.new(0, i1)
assert_equal true, LinkedList.new(i0).palindrome?
end
def test_2
i6 = Node.new(0)
i5 = Node.new(1, i6)
i4 = Node.new(2, i5)
i3 = Node.new(3, i4)
i2 = Node.new(2, i3)
i1 = Node.new(1, i2)
i0 = Node.new(0, i1)
assert_equal true, LinkedList.new(i0).palindrome?
end
def test_3
i3 = Node.new(3)
i2 = Node.new(2, i3)
i1 = Node.new(1, i2)
i0 = Node.new(0, i1)
assert_equal false, LinkedList.new(i0).palindrome?
end
end