leetcode

0 class Solution {

1 public:

2 int longestSquareStreak(vector<int> &nums) {

3 static int seen[100001];

4

5 memset(seen, 0x00, sizeof(seen));

6 sort(begin(nums), end(nums));

7

8 int res = 0;

9 for (int i = 0; i < size(nums); i++) {

10 const int crnt = nums[i];

11 if (crnt < 317) {

12 seen[crnt * crnt] = seen[crnt] + 1;

13 }

14 res = max(res, seen[crnt]);

15 }

16

17 return res ? res + 1 : -1;

18 }

19 };