diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/erect_fence.rs | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/erect_fence.rs')
-rw-r--r-- | other/erect_fence.rs | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/erect_fence.rs b/other/erect_fence.rs new file mode 100644 index 0000000..6dee425 --- /dev/null +++ b/other/erect_fence.rs @@ -0,0 +1,27 @@ +use std::collections::VecDeque; +type Tree = Vec<i32>; +struct Solution; + +impl Solution { + pub fn outer_trees(mut trees: Vec<Tree>) -> Vec<Tree> { + fn cross(a: &Tree, b: &Tree, c: &Tree) -> i32 { + return (c[1] - a[1]) * (a[0] - b[0]) - (a[1] - b[1]) * (c[0] - a[0]) + } + trees.sort(); + let mut dv: VecDeque<Tree> = VecDeque::new(); + for t in trees { + while dv.len() >= 2 && cross(&dv[dv.len() - 1], &dv[dv.len() - 2], &t) < 0 { + dv.pop_back(); + } + dv.push_back(t.clone()); + while dv.len() >= 2 && cross(&dv[0], &dv[1], &t) > 0 { + dv.pop_front(); + } + dv.push_front(t.clone()); + } + let mut fence = Vec::from(dv); + fence.sort_unstable(); + fence.dedup(); + fence + } +} |