leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0593.cpp (687B)

0 class Solution { 1 static int distance(const vector<int> p1, const vector<int> p2) { 2 const int x = p1[0] - p2[0]; 3 const int y = p1[1] - p2[1]; 4 5 return x * x + y * y; 6 } 7 8 public: 9 bool validSquare(const vector<int> &p1, const vector<int> &p2, const vector<int> &p3, 10 const vector<int> &p4) const { 11 if (p1 == p2) return false; 12 13 int d[] = { 14 distance(p1, p2), distance(p1, p3), distance(p1, p4), 15 distance(p2, p3), distance(p2, p4), distance(p3, p4), 16 }; 17 18 sort(d, d + 6); 19 20 return d[0] == d[1] && d[0] == d[2] && d[0] == d[3] && 2 * d[0] == d[4] && 2 * d[0] == d[5]; 21 } 22 };