原题目:https://leetcode-cn.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/
思路:
用数组m记录time[i]%60的个数,每次对time[i]做判断,如果time[i]%60 != 0,那么久在m里面找60-time[i]%60的个数。否则就找为0的个数。
代码:
class Solution {
public:
int numPairsDivisibleBy60(vector<int>& time) {
int sum=0;
int m[60]={0};
for(int i=0;i<time.size();i++){
if(time[i]%60){
sum += m[60-time[i]%60];
}
else{
sum += m[0];
}
m[time[i]%60]++;
}
return sum;
}
};