Merge branch 'master' of github.com:Neodelf/leetcode

Author: Neodelf

2/README.md

@@ -0,0 +1,10 @@
+### 2. Add Two Numbers
+
+You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+```
+Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+Output: 7 -> 0 -> 8
+```

2/add_two_numbers.rb

@@ -11,20 +11,20 @@
 # @param {ListNode} l2
 # @return {ListNode}
 def add_two_numbers(l1, l2)
-    ll_common = ListNode.new(nil)
-    ll = ll_common
+    ln_result = ListNode.new(nil)
+    ln = ln_result
     next_is_present = true
     while next_is_present
         next_is_present = l1&.next || l2&.next
-        ll_val = l1&.val.to_i + l2&.val.to_i + ll&.val.to_i
-        int = ll_val/10
+        ln_val = l1&.val.to_i + l2&.val.to_i + ln&.val.to_i
+        int = ln_val/10
 
-        ll.val = int > 0 ? ll_val - 10 : ll_val
-        ll.next = ListNode.new(int) if next_is_present || int > 0
+        ln.val = int > 0 ? ln_val - 10 : ln_val
+        ln.next = ListNode.new(int) if next_is_present || int > 0
 
         l1 = l1.next if l1
         l2 = l2.next if l2
-        ll = ll.next
+        ln = ln.next
     end
-    ll_common
+    ln_result
 end

README.md

@@ -0,0 +1,6 @@
+# leetcode-ruby-solutions
+Solutions of the issues from leetcode.com
+
+
+#### Tasks:
+* Change structure in order to repository has one README file with list of all solutions