594. 最长和谐子序列
代码:
class Solution {
public int findLHS(int[] nums) {
int ret = 0;
for (int i = 0; i < nums.length; i++)
{
int flag = 0, count = 0;
for (int j = 0; j < nums.length; j++)
{
if (nums[i] == nums[j]) count++;
else if (nums[i] == nums[j] + 1) {
count++;
flag = 1;
}
}
if (flag == 1) ret = Math.max(count, ret);
}
return ret;
}
}