diff --git a/codes/rust/chapter_computational_complexity/leetcode_two_sum.rs b/codes/rust/chapter_computational_complexity/leetcode_two_sum.rs
index 95d264b8..f6d45730 100644
--- a/codes/rust/chapter_computational_complexity/leetcode_two_sum.rs
+++ b/codes/rust/chapter_computational_complexity/leetcode_two_sum.rs
@@ -35,13 +35,16 @@ impl SolutionHashMap {
     }
 }
 
+// Driver Code
 fn main() {
+    // ======= Test Case =======
     let nums = vec![2,7,11,15];
     let target = 9;
 
+    // 方法一
     let res = SolutionBruteForce::two_sum(&nums, target);
     println!("方法一 res = {:?}", res);
-
+    // 方法二
     let res = SolutionHashMap::two_sum(&nums, target);
     println!("方法二 res = {:?}", res);
 }
\ No newline at end of file
diff --git a/codes/rust/chapter_computational_complexity/time_complexity.rs b/codes/rust/chapter_computational_complexity/time_complexity.rs
index 066dbac6..942ba471 100644
--- a/codes/rust/chapter_computational_complexity/time_complexity.rs
+++ b/codes/rust/chapter_computational_complexity/time_complexity.rs
@@ -15,6 +15,7 @@ fn constant(n: i32) -> i32 {
     count
 }
 
+/* 线性阶 */
 fn linear(n: i32) -> i32 {
     let mut count = 0;
     for _ in 0..n {