leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2483.cpp (349B)

0 class Solution { 1 public: 2 int bestClosingTime(string customers) { 3 int mini = 0, crnt = 0, res = 0; 4 5 for (int i = 0; i < customers.size(); i++) { 6 crnt += (customers[i] == 'Y') ? -1 : +1; 7 if (crnt >= mini) continue; 8 res = i + 1; 9 mini = crnt; 10 } 11 12 return res; 13 } 14 };