Sort by

recency

|

2260 Discussions

|

  • + 0 comments

    Mi solución en Python 3

    def breakingRecords(scores):
        # Write your code here
        best = scores[0]
        worse = scores[0]
        maxi = 0
        mini = 0
        for i in scores:
            if i > best:
                maxi += 1
                best = i
            elif i < worse:
                mini += 1
                worse = i
        return(maxi, mini)
    
  • + 0 comments

    python ;

    def breakingRecords(scores): min_s = max_s = 0 min_value = max_value = scores[0] for i in scores: if (i < min_value): min_value = i min_s = min_s + 1

        if (i > max_value):
            max_value = i
            max_s = max_s + 1
    return [max_s, min_s]  
    
  • + 0 comments

    def breakingRecords(scores): min_s = max_s = 0 min_value = max_value = scores[0] for i in scores: if (i < min_value): min_value = i min_s = min_s + 1

        if (i > max_value):
            max_value = i
            max_s = max_s + 1
    return [max_s, min_s] 
    
  • + 0 comments

    C++

    vector<int> breakingRecords(vector<int> scores) {
         int high=scores[0];
         int low=scores[0];
         int highcnt=0;
         int lowcnt=0;
         
         for(int i=1;i<scores.size();i++){
            if(scores[i]>high){
                high=scores[i];
                highcnt++;
            }
            else if(scores[i]<low){
                low=scores[i];
                lowcnt++;
            }
         }
         return {highcnt,lowcnt};
    }
    
  • + 0 comments

    Python 3:

    def breakingRecords(scores):
        min_s = max_s = 0
        min_value = max_value = scores[0]
        for i in scores:
            if (i < min_value):
                min_value = i
                min_s = min_s + 1
            
            
            if (i > max_value):
                max_value = i
                max_s = max_s + 1
        return [max_s, min_s]