[알고리즘] 5번째 알고리즘 문제 풀기

[SongGwanSeok]

📝 Description

무엇을?

• 1052. Grumpy Bookstore Owner
• 188. Best Time to Buy and Sell Stock IV

왜?

❗️Todo

• [ ]
• [ ]
• [ ]

ETC

기타사항

[SongGwanSeok]

1052. Grumpy Bookstore Owner

      
      int cur = 0;
      
      for(int i = 0; i < grumpy.size(); i++){
          if(grumpy[i] == 0){
              cur += customers[i];
          }
      }
      
      for(int i = 0; i < minutes; i++){
          if(grumpy[i] == 1) {
              cur += customers[i];
          }
      }
      
      int _max = cur;
      int p1 = 0;
      int p2 = minutes;
      while(p2 < grumpy.size()){
          if(grumpy[p1] == 1){
              cur -= customers[p1];
          }
          if(grumpy[p2] == 1){
              cur += customers[p2];
          }
          p1++, p2++;
          _max = max(_max, cur);
      }
      
      return _max;