0002

Author: ruoru

Algorithms/0002.add_two_numbers/add_two_numbers.rs

@@ -2,82 +2,53 @@ use std::cmp;
 // Definition for singly-linked list.
 #[derive(PartialEq, Eq, Clone, Debug)]
 pub struct ListNode {
-  pub val: i32,
-  pub next: Option<Box<ListNode>>
+    pub val: i32,
+    pub next: Option<Box<ListNode>>,
 }
 
 impl ListNode {
-  #[inline]
-  fn new(val: i32) -> Self {
-    ListNode {
-      next: None,
-      val
+    #[inline]
+    pub fn new(val: i32) -> Self { // ?? leetcode is private
+        ListNode { next: None, val }
     }
-  }
+}
+
+pub struct Solution {
 }
 
 impl Solution {
-    pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
-        let mut i1 = l1;
-        let mut i2 = l2;
+    pub fn add_two_numbers(
+        l1: Option<Box<ListNode>>,
+        l2: Option<Box<ListNode>>,
+    ) -> Option<Box<ListNode>> {
+        let mut n1 = l1;
+        let mut n2 = l2;
         let mut overflow_value = 0;
+        let mut vec = Vec::new();
 
-        while i1.is_some() || i2.is_some() {
-            let v1 = i1.unwrap_or( Box::new(ListNode::new(0)) );
-            let v2 = i2.unwrap_or( Box::new(ListNode::new(0)) );
+        while n1.is_some() || n2.is_some() || overflow_value > 0 {
+            let v1 = n1.unwrap_or(Box::new(ListNode::new(0)));
+            let v2 = n2.unwrap_or(Box::new(ListNode::new(0)));
 
             let mut v = v1.val + v2.val + overflow_value;
             overflow_value = v / 10;
             v = v % 10;
 
-            results.next.get_or_insert(Box::new(ListNode::new(v)));
-            curr = &mut results.next;
+            vec.push(v);
 
-            i1 = v1.next;
-            i2 = v2.next;
-            println!( "{:?}",  v);
+            n1 = v1.next;
+            n2 = v2.next;
         }
 
-        
-
-        // println!( "{:?}",  i1.val);
-
-
-        // let i2 = i1.next.unwrap_or( Box::new(ListNode::new(0)));
-
-        // println!( "{:?}",  i2.val);
-
-        // let i3 = i2.next.unwrap_or( Box::new(ListNode::new(0)));
-
-        // println!( "{:?}",  i3.val);
+        let mut vec_last_index = vec.len() - 1;
+        let mut results = Some(Box::new(ListNode::new(vec[vec_last_index])));
 
-        // let i4 = i3.next.unwrap_or( Box::new(ListNode::new(0)));
-
-        // println!( "{:?}",  i4.val);
-        
-        // let mut results: Some;
-        // let mut i1 = l1;
-        // let mut i2 = l2;
-
-        // let mut overfalow_value: i32 = 0;
-
-        // while i1.is_some() || i2.is_some() {
-        //     let mut v1 = i1.unwrap_or(0);
-        //     let mut v2 = i2.unwrap_or(0);
-
-        //     let mut v = v1 + v2 + overflow_value;
-        //     overflow_value = v / 10;
-        //     v = v % 10;
-
-        //     results.next.push_back(Some(Box::new(ListNode::new(v))));
-
-        //     i1 = iter1.next;
-        //     i2 = iter2.next;
-        // }
-        // return results;
+        for i in (0..vec_last_index).rev() {
+            let mut ln = ListNode::new(vec[i]);
+            ln.next = results;
+            results = Some(Box::new(ln));
+        }
 
-        return None;
+        return results;
     }
 }
-
-pub struct Solution {}

Algorithms/0002.add_two_numbers/add_two_numbers_test.rs

@@ -1,11 +1,10 @@
 mod add_two_numbers;
-mod list_node;
 use add_two_numbers::Solution;
-use list_node::ListNode;
+use add_two_numbers::ListNode;
 
 fn main() {
     let arr1 = [9, 4, 5];
-    let arr2 = [3, 4, 5, 5];
+    let arr2 = [3, 4, 5];
 
     let arr1_last_index = arr1.len() - 1;
     let arr2_last_index = arr2.len() - 1;

Algorithms/0002.add_two_numbers/list_node.rs

@@ -16,13 +16,13 @@ leetcode in rust lang.
 
 ## Answer
 
-|Order|Topic|Difficult|Runtime|Memory|Collection|
+|Order|Topic|Difficult|Runtime(ms)|Memory(MB)|Collection|
 |:-:|:-|:-:|:-:|:-:|---|
-|[1](https://leetcode.com/problems/two-sum/)|[Two Sum](./Algorithms/0001.two_sum)|Easy|0 ms|1.6 MB||
-|[2](https://leetcode.com/problems/add-two-numbers/)|[Add Two Numbers](./Algorithms/0002.add_two_numbers)|Medium||||
-|[3](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest_substring_without_repeating_characters)|Medium||||
-|[4](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|Hard|0 ms|2.1 MB||
-|[13](https://leetcode.com/problems/roman-to-integer/)|[Roman to Integer](./Algorithms/0013.roman_to_integer)|Easy|0 ms|1.9 MB||
-|[70]()|[Climbing Stairs](./Algorithms/0070.climbing_stairs)|Easy|0 ms|2.1 MB||
-|[88]()|[Merge Sorted Array](./Algorithms/0088.merge_sorted_array)|Easy|0 ms|2.2 MB||
-|[118]()|[Pascal's Triangle](./Algorithms/0118.pascals_triangle)|Easy|0 ms|2.1 MB||
+|[1](https://leetcode.com/problems/two-sum/)|[Two Sum](./Algorithms/0001.two_sum)|<font color=#00af9b>Easy</font>|0|1.6||
+|[2](https://leetcode.com/problems/add-two-numbers/)|[Add Two Numbers](./Algorithms/0002.add_two_numbers)|<font color=#ffb800>Medium</font>|0|2.2||
+|[3](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest_substring_without_repeating_characters)|<font color=#ffb800>Medium</font>||||
+|[4](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|<font color=#ff2d55>Hard</font>|0|2.1||
+|[13](https://leetcode.com/problems/roman-to-integer/)|[Roman to Integer](./Algorithms/0013.roman_to_integer)|<font color=#00af9b>Easy</font>|0|1.9||
+|[70]()|[Climbing Stairs](./Algorithms/0070.climbing_stairs)|<font color=#00af9b>Easy</font>|0|2.1||
+|[88]()|[Merge Sorted Array](./Algorithms/0088.merge_sorted_array)|<font color=#00af9b>Easy</font>|0|2.2||
+|[118]()|[Pascal's Triangle](./Algorithms/0118.pascals_triangle)|<font color=#00af9b>Easy</font>|0|2.1||