From 3afb78c3b95c7735cfd211087e6b44f3f9e790d7 Mon Sep 17 00:00:00 2001
From: "daniel.w" <daniel.w@intteam.net>
Date: Tue, 25 Jun 2024 07:16:53 +0800
Subject: [PATCH] feat: fmt

---
 array/1_binrary_search_2529/src/main.rs   | 18 ++++++++----------
 array/3_front_end_pointer_977/src/main.rs |  6 +++---
 array/4_sliding_window_209/src/main.rs    | 12 ++++++------
 array/fast_slow_pointer_26/Cargo.toml     |  6 ++++++
 array/fast_slow_pointer_26/src/main.rs    |  8 ++++++++
 5 files changed, 31 insertions(+), 19 deletions(-)
 create mode 100644 array/fast_slow_pointer_26/Cargo.toml
 create mode 100644 array/fast_slow_pointer_26/src/main.rs

diff --git a/array/1_binrary_search_2529/src/main.rs b/array/1_binrary_search_2529/src/main.rs
index b6b19ca..b1dde46 100644
--- a/array/1_binrary_search_2529/src/main.rs
+++ b/array/1_binrary_search_2529/src/main.rs
@@ -10,17 +10,15 @@ fn main() {
 }
 
 fn max_positive_or_negative_count(nums: Vec<i32>) -> i32 {
-   let (mut pos, mut neg): (i32,i32) = (0,0);
+    let (mut pos, mut neg): (i32, i32) = (0, 0);
     for item in nums {
-       if item >0{
-           pos +=1;
-       }
-       if item <0{
-           neg +=1;
-       }
-   }
+        if item > 0 {
+            pos += 1;
+        }
+        if item < 0 {
+            neg += 1;
+        }
+    }
 
     pos.max(neg) as i32
-
-
 }
diff --git a/array/3_front_end_pointer_977/src/main.rs b/array/3_front_end_pointer_977/src/main.rs
index 4d224ee..a0fb043 100644
--- a/array/3_front_end_pointer_977/src/main.rs
+++ b/array/3_front_end_pointer_977/src/main.rs
@@ -1,7 +1,7 @@
 // 解題影片 https://www.youtube.com/watch?v=9u1qXgHMb7Q&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=3
 // leetcode https://leetcode.com/problems/squares-of-a-sorted-array/
 fn main() {
-    let case_a: Vec<i32> = vec![-4,-1,0,3,10];
+    let case_a: Vec<i32> = vec![-4, -1, 0, 3, 10];
     let result = sorted_squares(case_a);
     println!("Result: {:?}", result);
 }
@@ -22,7 +22,7 @@ pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
     while new_pointer >= 0 {
         // 都是拿到比較大的，故從否面先塞
         // 相等的話移動誰沒差，就移動前指針
-        if get_double(nums[left])>= get_double(nums[right]){
+        if get_double(nums[left]) >= get_double(nums[right]) {
             result[new_pointer as usize] = get_double(nums[left]);
             new_pointer -= 1;
             left += 1;
@@ -36,6 +36,6 @@ pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
     return result;
 }
 
-fn get_double(val: i32)->i32{
+fn get_double(val: i32) -> i32 {
     val * val
 }
diff --git a/array/4_sliding_window_209/src/main.rs b/array/4_sliding_window_209/src/main.rs
index 689976a..1342ec8 100644
--- a/array/4_sliding_window_209/src/main.rs
+++ b/array/4_sliding_window_209/src/main.rs
@@ -1,8 +1,8 @@
 // 解題影片 https://www.youtube.com/watch?v=7brhpecjOSY&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=4
 // leetcode https://leetcode.com/problems/minimum-size-subarray-sum/
 fn main() {
-    let case_a: Vec<i32> = vec![2,3,1,2,4,3];
-    let result = min_sub_array_len(7,case_a);
+    let case_a: Vec<i32> = vec![2, 3, 1, 2, 4, 3];
+    let result = min_sub_array_len(7, case_a);
     println!("Result: {:?}", result);
 }
 
@@ -57,10 +57,10 @@ pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
     result
 }
 
-fn min(val_1:i32, val_2:i32) -> i32{
+fn min(val_1: i32, val_2: i32) -> i32 {
     if val_1 > val_2 {
-        return val_2
+        return val_2;
     }
 
-    return val_1
-}
\ No newline at end of file
+    return val_1;
+}
diff --git a/array/fast_slow_pointer_26/Cargo.toml b/array/fast_slow_pointer_26/Cargo.toml
new file mode 100644
index 0000000..8a73bc1
--- /dev/null
+++ b/array/fast_slow_pointer_26/Cargo.toml
@@ -0,0 +1,6 @@
+[package]
+name = "fast_slow_pointer_26"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
diff --git a/array/fast_slow_pointer_26/src/main.rs b/array/fast_slow_pointer_26/src/main.rs
new file mode 100644
index 0000000..b2eb06c
--- /dev/null
+++ b/array/fast_slow_pointer_26/src/main.rs
@@ -0,0 +1,8 @@
+fn main() {
+    println!("Hello, world!");
+}
+
+pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
+    let mut slow_pointer :usize= 0;
+    let mut fast_pointer:usize=0;
+}
\ No newline at end of file