20241024 finished.

src/problem/p1_two_sum.rs

@@ -6,29 +6,29 @@
  * You can return the answer in any order.
  *  
  * <strong class="example">Example 1:
- * 
+ *
  * Input: nums = [2,7,11,15], target = 9
  * Output: [0,1]
  * Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
- * 
+ *
  * <strong class="example">Example 2:
- * 
+ *
  * Input: nums = [3,2,4], target = 6
  * Output: [1,2]
- * 
+ *
  * <strong class="example">Example 3:
- * 
+ *
  * Input: nums = [3,3], target = 6
  * Output: [0,1]
- * 
+ *
  *  
  * Constraints:
- * 
+ *
  * 	2 <= nums.length <= 10^4
  * 	-10^9 <= nums[i] <= 10^9
  * 	-10^9 <= target <= 10^9
  * 	Only one valid answer exists.
- * 
+ *
  *  
  * Follow-up: Can you come up with an algorithm that is less than O(n^2)<font face="monospace"> </font>time complexity?
  */