feat: fmt
This commit is contained in:
parent
855aa90d74
commit
3afb78c3b9
|
@ -10,17 +10,15 @@ fn main() {
|
||||||
}
|
}
|
||||||
|
|
||||||
fn max_positive_or_negative_count(nums: Vec<i32>) -> i32 {
|
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 {
|
for item in nums {
|
||||||
if item >0{
|
if item > 0 {
|
||||||
pos +=1;
|
pos += 1;
|
||||||
}
|
}
|
||||||
if item <0{
|
if item < 0 {
|
||||||
neg +=1;
|
neg += 1;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pos.max(neg) as i32
|
pos.max(neg) as i32
|
||||||
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,7 +1,7 @@
|
||||||
// 解題影片 https://www.youtube.com/watch?v=9u1qXgHMb7Q&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=3
|
// 解題影片 https://www.youtube.com/watch?v=9u1qXgHMb7Q&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=3
|
||||||
// leetcode https://leetcode.com/problems/squares-of-a-sorted-array/
|
// leetcode https://leetcode.com/problems/squares-of-a-sorted-array/
|
||||||
fn main() {
|
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);
|
let result = sorted_squares(case_a);
|
||||||
println!("Result: {:?}", result);
|
println!("Result: {:?}", result);
|
||||||
}
|
}
|
||||||
|
@ -22,7 +22,7 @@ pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
|
||||||
while new_pointer >= 0 {
|
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]);
|
result[new_pointer as usize] = get_double(nums[left]);
|
||||||
new_pointer -= 1;
|
new_pointer -= 1;
|
||||||
left += 1;
|
left += 1;
|
||||||
|
@ -36,6 +36,6 @@ pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
fn get_double(val: i32)->i32{
|
fn get_double(val: i32) -> i32 {
|
||||||
val * val
|
val * val
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,8 +1,8 @@
|
||||||
// 解題影片 https://www.youtube.com/watch?v=7brhpecjOSY&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=4
|
// 解題影片 https://www.youtube.com/watch?v=7brhpecjOSY&list=PL-qDGN2q6cbClYCRpJ2pyrlhYK9VjZmL3&index=4
|
||||||
// leetcode https://leetcode.com/problems/minimum-size-subarray-sum/
|
// leetcode https://leetcode.com/problems/minimum-size-subarray-sum/
|
||||||
fn main() {
|
fn main() {
|
||||||
let case_a: Vec<i32> = vec![2,3,1,2,4,3];
|
let case_a: Vec<i32> = vec![2, 3, 1, 2, 4, 3];
|
||||||
let result = min_sub_array_len(7,case_a);
|
let result = min_sub_array_len(7, case_a);
|
||||||
println!("Result: {:?}", result);
|
println!("Result: {:?}", result);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -57,10 +57,10 @@ pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
|
||||||
result
|
result
|
||||||
}
|
}
|
||||||
|
|
||||||
fn min(val_1:i32, val_2:i32) -> i32{
|
fn min(val_1: i32, val_2: i32) -> i32 {
|
||||||
if val_1 > val_2 {
|
if val_1 > val_2 {
|
||||||
return val_2
|
return val_2;
|
||||||
}
|
}
|
||||||
|
|
||||||
return val_1
|
return val_1;
|
||||||
}
|
}
|
|
@ -0,0 +1,6 @@
|
||||||
|
[package]
|
||||||
|
name = "fast_slow_pointer_26"
|
||||||
|
version = "0.1.0"
|
||||||
|
edition = "2021"
|
||||||
|
|
||||||
|
[dependencies]
|
|
@ -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;
|
||||||
|
}
|
Loading…
Reference in New Issue