ARST打卡第276周

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

class Solution {
public:
    int minimumOperationsToMakeKPeriodic(string word, int k) {
        unordered_map<string, int> cnt;
        int n = word.length();
        for (int i = 0; i < n; i += k) {
            cnt[word.substr(i, k)]++;
        }
        int max_cnt = 0;
        for (auto& wc : cnt) {
            max_cnt = max(wc.second, max_cnt);
        }
        return n/k - max_cnt;
    }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19

use std::collections::HashMap;
use std::cmp::min;

impl Solution {
    pub fn minimum_operations_to_make_k_periodic(word: String, k: i32) -> i32 {
        let n = word.len();
        let mut res: i32 = 0x3f3f3f3f;
        let mut count: HashMap<String, i32> = HashMap::new();
        let mut i = 0;
        while i < n {
            let mut part = &word[i..(i + k as usize)];
            *count.entry(part.to_string()).or_insert(0) += 1;
            res = min(res, n as i32 / k - *count.get(part).unwrap());
            i += k as usize;
        }
        res
    }
}
// 链接：https://leetcode.cn/problems/minimum-number-of-operations-to-make-word-k-periodic/solutions/2878600/k-zhou-qi-zi-fu-chuan-xu-yao-de-zui-shao-vw1b/