style: move documents into libs

README.md

@@ -7,5 +7,10 @@ Resolving problems of LeetCode in RustLang.
 
 ## Solusions
 
-* [7. Reverse Integer](./reverse_integer/README.md)
-* [15. 3 Sum](./three_sum/README.md)
+* [7. Reverse Integer](./reverse_integer/src/lib.rs)
+* [15. 3 Sum](./three_sum/src/lib.rs)
+* [215. Kth Largest Element in an Array](./kth_largest/src/lib.rs)
+
+## References
+
+* [LeetcodeTop](https://github.com/afatcoder/LeetcodeTop): Top Hit Leetcode problems in interviews.

kth_largest/src/lib.rs

@@ -1,8 +1,15 @@
-#![allow(dead_code)]
-
 /*!
- * It works but slower than:
- * ```rust,ignore
+ * # 215. Kth Largest Element in an Array
+ *
+ * * [Problem link](https://leetcode.com/problems/kth-largest-element-in-an-array/)
+ *
+ * ## Other Solutions
+ *
+ * The solution works but slower than sort all elements and get by index in Rust like below.
+ *
+ * ```rust,no_run
+ * # struct Solution {}
+ *
  * impl Solution {
  *     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
  *         let mut nums = nums;
@@ -11,7 +18,9 @@
  *     }
  * }
  * ```
-*/
+ */
+
+#![allow(dead_code)]
 
 struct Solution {}
 

reverse_integer/src/lib.rs

@@ -1,3 +1,9 @@
+/*!
+ * # 7. Reverse Integer
+ *
+ * * [Problem link](https://leetcode.com/problems/reverse-integer/)
+ */
+
 #![allow(dead_code)]
 
 struct Solution {}

three_sum/src/lib.rs

@@ -1,3 +1,9 @@
+/*!
+ * # 15. 3 Sum
+ *
+ * * [Problem link](https://leetcode.com/problems/3sum/)
+ */
+
 #![allow(dead_code)]
 
 struct Solution {}