第 19 场双周赛

Posted on | In , | |
Words count in article: 390 | Reading time ≈ 2

5311. 将数字变成 0 的操作次数

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
    int numberOfSteps (int num) {
        int count = 0;
        while(num){
            if(num % 2 == 0) num /= 2;
            else num -= 1;
            count++;
        }
        return count;
    }
};

5312. 大小为 K 且平均值大于等于阈值的子数组数目

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
public:
    int numOfSubarrays(vector<int>& arr, int k, int threshold) {
        for(int i=1; i<arr.size(); i++){
            arr[i] += arr[i-1];
        }
        int count = 0;
        for(int i=k; i<arr.size(); i++){
            if((arr[i]-arr[i-k])/k >= threshold) 
                count++;
        }
        if(arr[k-1]/k >= threshold) count++;
        return count;
    }
};

5313. 时钟指针的夹角

1
2
3
4
5
6
7
8
9
10
class Solution {
public:
    double angleClock(int hour, int minutes) {
        double minu = (double)minutes;
        double hou = (hour%12)*5.0 + minu/60*5.0;
        double diff = abs(minu-hou);
        diff = min(diff, abs(60-diff));
        return diff/60*360;
    }
};

5314. 跳跃游戏 IV

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
public:
    int minJumps(vector<int>& arr) {
        int ans = 0, c = 0, lop = 0; 
        vector<int> v; 
        map<int, vector<int>> m; 
        m.clear(); 
        
        for (int i = 0; i < arr.size(); ++ i){
            if (i && i != 1 && arr[i] == arr[i - 1]) continue;
            else{
                v.push_back(arr[i]); 
                m[arr[i]].push_back(c); 
                ++ c; 
            }
        }
        
        queue<int> Q;
        vector<bool> vis (v.size()+1, false);
        Q.push(0); vis[0] = true;
        
        while(!Q.empty()){
            lop = Q.size(); 
            for(int j = 0; j < lop; ++ j){
                int tmp = Q.front(); Q.pop();
                if(tmp == v.size() - 1) return ans; 
                if(tmp > 0 && !vis[tmp - 1]){ 
                    Q.push(tmp - 1);
                    vis[tmp - 1] = true;
                }
                if(tmp < v.size() - 1 && !vis[tmp + 1]){ 
                    Q.push(tmp + 1);
                    vis[tmp + 1] = true;
                }
                for(int i = 0; i < m[v[tmp]].size(); ++ i){ 
                    if(!vis[m[v[tmp]][i]]) { 
                        Q.push(m[v[tmp]][i]);
                        vis[m[v[tmp]][i]] = true;
                    }
                }
            }
            ++ ans; 
        }
        
        return ans;
    }
};
Donate? comment?