LC.P2744[最大字符串配对数目] 方法一:哈希表123456789101112131415class Solution { public int maximumNumberOfStringPairs(String[] words) { int ans = 0; boolean[][] visited = new boolean[26][26]; for (String word : words) { int x = word.charAt(0) - 'a', y = word.charAt(1) - 'a'; if (visited[y][x]){ ++ans; } else { visited[x][y] = true; } } return ans; }} 时间复杂度:$O(n)$ 空间复杂度:$O(n)$