Leetcode-Solutions/degree_array.cpp at master · cpj2195/Leetcode-Solutions · GitHub

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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include"essentials.cpp"


int get_freq(vector<int>v1,int low,int high){
         map<int,int>mp1;
        for(int i=low;i<=high;i++){
            cout<<v1[i]<<" ";
            mp1[v1[i]]++;

        }
        cout<<endl;
        // for(auto it:mp1){
        //     cout<<it.first<<" "<<it.second<<endl;
        // }
        int element;
        int max_freq=0;
        for(auto it:mp1){

                // cout<<it.second<<" "<<max_freq<<endl;
                // max_freq=max(max_freq,it.second);
                if(it.second>max_freq){
                    max_freq=it.second;
                    element=it.first;
                }


            }

            // cout<<max_freq<<endl;

            return element;


    }


int findShortestSubArray(vector<int>& nums){

int element=get_freq(nums,0,nums.size()-1);


cout<<element<<endl;
int i=0;
int j=nums.size()-1;
while(i<j){

while(i<j && nums[i]!=element){
    i++;
}
while(i<j && nums[j]!=element){
    j--;
}

cout<<i<<" "<<j<<endl;

return 1;


}


}


int main(){


vector<int>nums;
nums.push_back(1);
nums.push_back(2);
nums.push_back(2);

nums.push_back(3);
nums.push_back(1);
// nums.push_back(4);
// nums.push_back(2);
int freq=get_freq(nums,0,nums.size()-1);

// cout<<freq<<endl;
int hello=findShortestSubArray(nums);

return 1;


}