use std::mem::swap;

impl Solution {
    pub fn distance_between_bus_stops(distance: Vec<i32>, start: i32, destination: i32) -> i32 {
        let (mut val, n, mut ans) = (0, distance.len(), 0);
        let (mut s, mut d) = (start, destination);
        if s > d {
            swap(&mut s, &mut d);
        }
        for i in s..d {
            val += distance[i as usize];
        }
        ans = val; val = 0;
        let mut i = d;
        while i != s {
            val += distance[i as usize];
            i = (i + 1) % n as i32;
        }
        return std::cmp::min(val, ans);
    }
}

impl Solution {
    pub fn unique_occurrences(arr: Vec<i32>) -> bool {
        use std::collections::{HashMap, HashSet};

        let (mut map, mut set) = (HashMap::new(), HashSet::new());
        for i in arr {
            *(map.entry(i).or_insert(0)) += 1;
        }

        for (_, val) in map {
            if set.contains(&val) {
                return false;
            }
            set.insert(val);
        }
        return true;
    }
}

impl Solution {
    pub fn remove_duplicates(s: String, k: i32) -> String {
        let mut stack = vec![(0, '#')];
        let mut ans = "".to_string();
        for c in s.chars() {
            let index = stack.len() - 1;
            if stack[index].1 != c {
                stack.push((1, c));
            } else if stack[index].0 == k - 1 {
                stack.pop();
            } else {
                let mut val = stack[index];
                val.0 += 1;
                stack[index] = val;
            }
        }

        for item in stack {
            ans.push_str(&(0..item.0 as usize).map(|_| item.1).collect::<String>());
        }
        return ans;
    }
}