LeetCode Number of Boomerangs

原题链接在这里：https://leetcode.com/problems/number-of-boomerangs/

题目：

Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between iand j equals the distance between i and k (the order of the tuple matters).

Find the number of boomerangs. You may assume that n will be at most 500 and coordinates of points are all in the range [-10000, 10000] (inclusive).

Example:

Input:
[[0,0],[1,0],[2,0]]

Output:
2

Explanation:
The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]]

题解：

对于每一个点，求其余所有点到这点的距离. 距离相同的都放在一起, 用HashMap<Integer, Integer> hm保存. key是distance, value是相同distance的点的个数.

对于这一点不同的组合方法有value * (value-1)种.

每个点的组合方法都加到res中return.

Time COmplexity: O(n^2), n = points.length. Space: O(n).

AC Java:

public class Solution {
    public int numberOfBoomerangs(int[][] points) {
        if(points == null || points.length == 0){
            return 0;
        }
        
        int res = 0;
        HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
        for(int i = 0; i<points.length; i++){
            for(int j = 0; j<points.length; j++){
                if(i == j){
                    continue;
                }
                
                int dist = getDistance(points[i], points[j]);
                hm.put(dist, hm.getOrDefault(dist, 0)+1);
            }
            
            for(int val : hm.values()){
                res += val * (val-1);
            }
            hm.clear();
        }
        
        return res;
    }
    
    private int getDistance(int [] p, int [] q){
        int dx = p[0] - q[0];
        int dy = p[1] - q[1];
        return dx*dx + dy*dy;
    }
}