snipt

Ctrl+h for KB shortcuts

Ruby

Linked List

class Node
  attr_accessor :value, :next_node

  def initialize(value, next_node = nil)
    @value = value
    @next_node = next_node
  end
end

class LinkedList
  attr_accessor :head

  def initialize(value)
    @head = Node.new(value)
  end

  def push(value)
    current_node = @head
    if @head.value == nil
      @head = Node.new(value)
    else
      while current_node != nil
        if current_node.next_node == nil
          current_node.next_node = Node.new(value)
          break
        end
        current_node = current_node.next_node
      end
    end
  end

  def delete_value(value)
    current_node = @head
    if @head.value == value
      @head = @head.next_node
    else
      while current_node != nil
        if current_node.next_node.value == value
          current_node.next_node = current_node.next_node.next_node
          break
        end
        current_node = current_node.next_node
      end
    end
  end

  def pop
    current_node = @head
    while current_node != nil
      if current_node.next_node.next_node == nil
        current_node.next_node = nil
        break
      end
      current_node = current_node.next_node
    end
  end

  def to_array
    temp_array = []
    current_node = @head
    while current_node != nil
      temp_array << current_node.value
      current_node = current_node.next_node
    end
    return temp_array
  end
end

def assert_equal(input1, input2)
  raise "Does not equal" unless input1 == input2
end

link_list = LinkedList.new(5)

link_list.push(7)
link_list.push(9)
link_list.push(11)
link_list.push(13)
assert_equal(link_list.to_array,[5,7,9,11,13])

link_list.pop
assert_equal(link_list.to_array,[5,7,9,11])

link_list.delete_value(9)
assert_equal(link_list.to_array,[5,7,11])
https://snipt.net/embed/f73a2bd31c7cb38770706892ef0a3b2e/
/raw/f73a2bd31c7cb38770706892ef0a3b2e/
f73a2bd31c7cb38770706892ef0a3b2e
rb
Ruby
85
2019-07-21T10:43:48
True
False
False
Feb 19, 2014 at 11:37 PM
/api/public/snipt/115347/
linked-list-5
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a> <a href="#L-34">34</a> <a href="#L-35">35</a> <a href="#L-36">36</a> <a href="#L-37">37</a> <a href="#L-38">38</a> <a href="#L-39">39</a> <a href="#L-40">40</a> <a href="#L-41">41</a> <a href="#L-42">42</a> <a href="#L-43">43</a> <a href="#L-44">44</a> <a href="#L-45">45</a> <a href="#L-46">46</a> <a href="#L-47">47</a> <a href="#L-48">48</a> <a href="#L-49">49</a> <a href="#L-50">50</a> <a href="#L-51">51</a> <a href="#L-52">52</a> <a href="#L-53">53</a> <a href="#L-54">54</a> <a href="#L-55">55</a> <a href="#L-56">56</a> <a href="#L-57">57</a> <a href="#L-58">58</a> <a href="#L-59">59</a> <a href="#L-60">60</a> <a href="#L-61">61</a> <a href="#L-62">62</a> <a href="#L-63">63</a> <a href="#L-64">64</a> <a href="#L-65">65</a> <a href="#L-66">66</a> <a href="#L-67">67</a> <a href="#L-68">68</a> <a href="#L-69">69</a> <a href="#L-70">70</a> <a href="#L-71">71</a> <a href="#L-72">72</a> <a href="#L-73">73</a> <a href="#L-74">74</a> <a href="#L-75">75</a> <a href="#L-76">76</a> <a href="#L-77">77</a> <a href="#L-78">78</a> <a href="#L-79">79</a> <a href="#L-80">80</a> <a href="#L-81">81</a> <a href="#L-82">82</a> <a href="#L-83">83</a> <a href="#L-84">84</a> <a href="#L-85">85</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="k">class</span> <span class="nc">Node</span> </span><span id="L-2"><a name="L-2"></a> <span class="kp">attr_accessor</span> <span class="ss">:value</span><span class="p">,</span> <span class="ss">:next_node</span> </span><span id="L-3"><a name="L-3"></a> </span><span id="L-4"><a name="L-4"></a> <span class="k">def</span> <span class="nf">initialize</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="n">next_node</span> <span class="o">=</span> <span class="kp">nil</span><span class="p">)</span> </span><span id="L-5"><a name="L-5"></a> <span class="vi">@value</span> <span class="o">=</span> <span class="n">value</span> </span><span id="L-6"><a name="L-6"></a> <span class="vi">@next_node</span> <span class="o">=</span> <span class="n">next_node</span> </span><span id="L-7"><a name="L-7"></a> <span class="k">end</span> </span><span id="L-8"><a name="L-8"></a><span class="k">end</span> </span><span id="L-9"><a name="L-9"></a> </span><span id="L-10"><a name="L-10"></a><span class="k">class</span> <span class="nc">LinkedList</span> </span><span id="L-11"><a name="L-11"></a> <span class="kp">attr_accessor</span> <span class="ss">:head</span> </span><span id="L-12"><a name="L-12"></a> </span><span id="L-13"><a name="L-13"></a> <span class="k">def</span> <span class="nf">initialize</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-14"><a name="L-14"></a> <span class="vi">@head</span> <span class="o">=</span> <span class="no">Node</span><span class="o">.</span><span class="n">new</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-15"><a name="L-15"></a> <span class="k">end</span> </span><span id="L-16"><a name="L-16"></a> </span><span id="L-17"><a name="L-17"></a> <span class="k">def</span> <span class="nf">push</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-18"><a name="L-18"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="vi">@head</span> </span><span id="L-19"><a name="L-19"></a> <span class="k">if</span> <span class="vi">@head</span><span class="o">.</span><span class="n">value</span> <span class="o">==</span> <span class="kp">nil</span> </span><span id="L-20"><a name="L-20"></a> <span class="vi">@head</span> <span class="o">=</span> <span class="no">Node</span><span class="o">.</span><span class="n">new</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-21"><a name="L-21"></a> <span class="k">else</span> </span><span id="L-22"><a name="L-22"></a> <span class="k">while</span> <span class="n">current_node</span> <span class="o">!=</span> <span class="kp">nil</span> </span><span id="L-23"><a name="L-23"></a> <span class="k">if</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> <span class="o">==</span> <span class="kp">nil</span> </span><span id="L-24"><a name="L-24"></a> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> <span class="o">=</span> <span class="no">Node</span><span class="o">.</span><span class="n">new</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-25"><a name="L-25"></a> <span class="k">break</span> </span><span id="L-26"><a name="L-26"></a> <span class="k">end</span> </span><span id="L-27"><a name="L-27"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-28"><a name="L-28"></a> <span class="k">end</span> </span><span id="L-29"><a name="L-29"></a> <span class="k">end</span> </span><span id="L-30"><a name="L-30"></a> <span class="k">end</span> </span><span id="L-31"><a name="L-31"></a> </span><span id="L-32"><a name="L-32"></a> <span class="k">def</span> <span class="nf">delete_value</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> </span><span id="L-33"><a name="L-33"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="vi">@head</span> </span><span id="L-34"><a name="L-34"></a> <span class="k">if</span> <span class="vi">@head</span><span class="o">.</span><span class="n">value</span> <span class="o">==</span> <span class="n">value</span> </span><span id="L-35"><a name="L-35"></a> <span class="vi">@head</span> <span class="o">=</span> <span class="vi">@head</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-36"><a name="L-36"></a> <span class="k">else</span> </span><span id="L-37"><a name="L-37"></a> <span class="k">while</span> <span class="n">current_node</span> <span class="o">!=</span> <span class="kp">nil</span> </span><span id="L-38"><a name="L-38"></a> <span class="k">if</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span><span class="o">.</span><span class="n">value</span> <span class="o">==</span> <span class="n">value</span> </span><span id="L-39"><a name="L-39"></a> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> <span class="o">=</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-40"><a name="L-40"></a> <span class="k">break</span> </span><span id="L-41"><a name="L-41"></a> <span class="k">end</span> </span><span id="L-42"><a name="L-42"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-43"><a name="L-43"></a> <span class="k">end</span> </span><span id="L-44"><a name="L-44"></a> <span class="k">end</span> </span><span id="L-45"><a name="L-45"></a> <span class="k">end</span> </span><span id="L-46"><a name="L-46"></a> </span><span id="L-47"><a name="L-47"></a> <span class="k">def</span> <span class="nf">pop</span> </span><span id="L-48"><a name="L-48"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="vi">@head</span> </span><span id="L-49"><a name="L-49"></a> <span class="k">while</span> <span class="n">current_node</span> <span class="o">!=</span> <span class="kp">nil</span> </span><span id="L-50"><a name="L-50"></a> <span class="k">if</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span><span class="o">.</span><span class="n">next_node</span> <span class="o">==</span> <span class="kp">nil</span> </span><span id="L-51"><a name="L-51"></a> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> <span class="o">=</span> <span class="kp">nil</span> </span><span id="L-52"><a name="L-52"></a> <span class="k">break</span> </span><span id="L-53"><a name="L-53"></a> <span class="k">end</span> </span><span id="L-54"><a name="L-54"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-55"><a name="L-55"></a> <span class="k">end</span> </span><span id="L-56"><a name="L-56"></a> <span class="k">end</span> </span><span id="L-57"><a name="L-57"></a> </span><span id="L-58"><a name="L-58"></a> <span class="k">def</span> <span class="nf">to_array</span> </span><span id="L-59"><a name="L-59"></a> <span class="n">temp_array</span> <span class="o">=</span> <span class="o">[]</span> </span><span id="L-60"><a name="L-60"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="vi">@head</span> </span><span id="L-61"><a name="L-61"></a> <span class="k">while</span> <span class="n">current_node</span> <span class="o">!=</span> <span class="kp">nil</span> </span><span id="L-62"><a name="L-62"></a> <span class="n">temp_array</span> <span class="o">&lt;&lt;</span> <span class="n">current_node</span><span class="o">.</span><span class="n">value</span> </span><span id="L-63"><a name="L-63"></a> <span class="n">current_node</span> <span class="o">=</span> <span class="n">current_node</span><span class="o">.</span><span class="n">next_node</span> </span><span id="L-64"><a name="L-64"></a> <span class="k">end</span> </span><span id="L-65"><a name="L-65"></a> <span class="k">return</span> <span class="n">temp_array</span> </span><span id="L-66"><a name="L-66"></a> <span class="k">end</span> </span><span id="L-67"><a name="L-67"></a><span class="k">end</span> </span><span id="L-68"><a name="L-68"></a> </span><span id="L-69"><a name="L-69"></a><span class="k">def</span> <span class="nf">assert_equal</span><span class="p">(</span><span class="n">input1</span><span class="p">,</span> <span class="n">input2</span><span class="p">)</span> </span><span id="L-70"><a name="L-70"></a> <span class="k">raise</span> <span class="s2">&quot;Does not equal&quot;</span> <span class="k">unless</span> <span class="n">input1</span> <span class="o">==</span> <span class="n">input2</span> </span><span id="L-71"><a name="L-71"></a><span class="k">end</span> </span><span id="L-72"><a name="L-72"></a> </span><span id="L-73"><a name="L-73"></a><span class="n">link_list</span> <span class="o">=</span> <span class="no">LinkedList</span><span class="o">.</span><span class="n">new</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span> </span><span id="L-74"><a name="L-74"></a> </span><span id="L-75"><a name="L-75"></a><span class="n">link_list</span><span class="o">.</span><span class="n">push</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span> </span><span id="L-76"><a name="L-76"></a><span class="n">link_list</span><span class="o">.</span><span class="n">push</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span> </span><span id="L-77"><a name="L-77"></a><span class="n">link_list</span><span class="o">.</span><span class="n">push</span><span class="p">(</span><span class="mi">11</span><span class="p">)</span> </span><span id="L-78"><a name="L-78"></a><span class="n">link_list</span><span class="o">.</span><span class="n">push</span><span class="p">(</span><span class="mi">13</span><span class="p">)</span> </span><span id="L-79"><a name="L-79"></a><span class="n">assert_equal</span><span class="p">(</span><span class="n">link_list</span><span class="o">.</span><span class="n">to_array</span><span class="p">,</span><span class="o">[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">11</span><span class="p">,</span><span class="mi">13</span><span class="o">]</span><span class="p">)</span> </span><span id="L-80"><a name="L-80"></a> </span><span id="L-81"><a name="L-81"></a><span class="n">link_list</span><span class="o">.</span><span class="n">pop</span> </span><span id="L-82"><a name="L-82"></a><span class="n">assert_equal</span><span class="p">(</span><span class="n">link_list</span><span class="o">.</span><span class="n">to_array</span><span class="p">,</span><span class="o">[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">11</span><span class="o">]</span><span class="p">)</span> </span><span id="L-83"><a name="L-83"></a> </span><span id="L-84"><a name="L-84"></a><span class="n">link_list</span><span class="o">.</span><span class="n">delete_value</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span> </span><span id="L-85"><a name="L-85"></a><span class="n">assert_equal</span><span class="p">(</span><span class="n">link_list</span><span class="o">.</span><span class="n">to_array</span><span class="p">,</span><span class="o">[</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">11</span><span class="o">]</span><span class="p">)</span> </span></pre></div> </td></tr></table>