2078. Two Furthest Houses With Different Colors

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
    int maxDistance(vector<int>& colors) {
        
        int res = 0 , idx = -1;
        int n = colors.size();
        for(int i = 0 ;i<n-1 ;++i){
            for(int j = i+1;j<n;++j){
                if(colors[i]!=colors[j]) res = max(res, j-i);
            }
        }
        return res;
    }
};
1
2
3
4
5
6
7
8
9
class Solution:
    def maxDistance(self, colors: List[int]) -> int:
        ret , n= 0 , len(colors)
        for i in range(n-1):
            for j in range(i+1, n):
                if colors[i]!=colors[j]:
                    ret = max(ret, j-i)
        return ret

analysis

  • time complexity O(n^2)
  • space complexity O(1)