update readme

Author: ruoru

Algorithms/0002.add_two_numbers/add_two_numbers.rs

@@ -1,9 +1,23 @@
-use super::list_node::ListNode;
 use std::cmp;
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+  pub val: i32,
+  pub next: Option<Box<ListNode>>
+}
+
+impl ListNode {
+  #[inline]
+  fn new(val: i32) -> Self {
+    ListNode {
+      next: None,
+      val
+    }
+  }
+}
 
 impl Solution {
     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
-        let mut results: Option<Box<ListNode>>;
         let mut i1 = l1;
         let mut i2 = l2;
         let mut overflow_value = 0;

README.md

@@ -1,25 +1,28 @@
 # leetcode-rust
-leetcode in rust lang.
 
 [![LeetCode 排名](https://img.shields.io/badge/cruoru-1-blue.svg)](https://leetcode.com/cruoru/)
 [![codecov](https://codecov.io/gh/ruoru/leetcode-rust/branch/master/graph/badge.svg)](https://codecov.io/gh/ruoru/leetcode-rust)
 [![Build Status](https://api.travis-ci.org/ruoru/leetcode-rust.svg?branch=master)](https://www.travis-ci.org/ruoru/leetcode-rust)
 
-
+leetcode in rust lang.
 
 ## Schedule
 
+~~立个flag一年刷完leetcode~~
 
+## Start
+1. click `Order` column link to leetcode websit, paste `Topic` column link code in it and run.
+2. `xxx_test.rs` is main, `xxx.rs` is solution.
 
 ## Answer
 
 |Order|Topic|Difficult|Runtime|Memory|Collection|
 |:-:|:-|:-:|:-:|:-:|---|
-|1|[Two Sum](./Algorithms/0001.two_sum)|Easy|0 ms|1.6 MB||
-|2|[Add Two Numbers](./Algorithms/0002.add_two_numbers)|Medium||||
-|3|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest_substring_without_repeating_characters)|Medium||||
-|4|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|Hard|0 ms|2.1 MB||
-|13|[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)|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||