摘要:
/*C++双指针*/ class Solution { public: int maxArea(vector<int>& height) { int l = 0, r = height.size() - 1; int ans = 0; while (l < r) { int area = min(h 阅读全文
摘要:
int minimumOperations(char* leaves) { int n = strlen(leaves); int f[n][3]; f[0][0] = (leaves[0] == 'y'); f[0][1] = f[0][2] = f[1][2] = INT_MAX; for (i 阅读全文