Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 2078. Two Furthest Houses With Different Colors

---

題目：


解答：

class Solution {
public:
    int maxDistance(vector<int>& colors) {
        int l = 0;
        int r = 0;
        int n = colors.size();

        for (int i = 0; i < n; ++i) {
            if (colors[i] != colors[n - 1]) {
                l = max(l, n - 1 - i);
            }

            if (colors[n - 1 - i] != colors[0]) {
                r = max(r, n - 1 - i);
            }
        }

        return max(l, r);
    }
};