20240909 finished.

This commit is contained in:
jackfiled 2024-09-09 11:46:49 +08:00
parent bab488e101
commit f4dcf1a23d
2 changed files with 70 additions and 1 deletions

View File

@ -230,3 +230,4 @@ mod p3174_clear_digits;
mod p3176_find_the_maximum_length_of_a_good_subsequence_i; mod p3176_find_the_maximum_length_of_a_good_subsequence_i;
mod p3177_find_the_maximum_length_of_a_good_subsequence_ii; mod p3177_find_the_maximum_length_of_a_good_subsequence_ii;
mod p977_squares_of_a_sorted_array; mod p977_squares_of_a_sorted_array;
mod p2181_merge_nodes_in_between_zeros;

View File

@ -0,0 +1,68 @@
/**
* [2181] Merge Nodes in Between Zeros
*/
pub struct Solution {}
use crate::util::linked_list::{ListNode, to_list};
// submission codes start here
// Definition for singly-linked list.
// #[derive(PartialEq, Eq, Clone, Debug)]
// pub struct ListNode {
// pub val: i32,
// pub next: Option<Box<ListNode>>
// }
//
// impl ListNode {
// #[inline]
// fn new(val: i32) -> Self {
// ListNode {
// next: None,
// val
// }
// }
// }
impl Solution {
pub fn merge_nodes(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
let mut array = Vec::new();
let mut value = 0;
let mut node = head;
while let Some(n) = node {
if n.val == 0 {
if value != 0 {
array.push(value);
value = 0;
}
} else {
value += n.val;
}
node = n.next;
}
let mut current = None;
for &i in array.iter().rev() {
let mut n = ListNode::new(i);
n.next = current;
current = Some(Box::new(n));
}
current
}
}
// submission codes end
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_2181() {
assert_eq!(to_list(vec![4, 11]), Solution::merge_nodes(to_list(vec![0, 3, 1, 0, 4, 5, 2, 0])));
assert_eq!(to_list(vec![1, 3, 4]), Solution::merge_nodes(to_list(vec![0, 1, 0, 3, 0, 2, 2, 0])));
}
}