find_maximum_number_of_string_pairs.cpp

// 最大字符串配对数目
// https://leetcode.cn/problems/find-maximum-number-of-string-pairs
// INLINE  ../../images/array/find_maximum_number_of_string_pairs.jpeg

#include <headers.hpp>

class Solution {
public:
  int maximumNumberOfStringPairs(vector<string> &words) {
    int n = words.size();
    int ans = 0;
    for (int i = 0; i < n; ++i) {
      for (int j = i + 1; j < n; ++j) {
        if (words[i][0] == words[j][1] && words[i][1] == words[j][0]) {
          ans++;
        }
      }
    }
    return ans;
  }
};