Leet Code知识点总结

LeetCode 594. Longest Harmonious Subsequence

考点	难度
Array	Easy

题目

Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited a doctor.

The doctor advised Alice to only eat n / 2 of the candies she has (n is always even). Alice likes her candies very much, and she wants to eat the maximum number of different types of candies while still following the doctor’s advice.

Given the integer array candyType of length n, return the maximum number of different types of candies she can eat if she only eats n / 2 of them.

思路

看到题首先想到计算每个数字出现的次数，从次数最多的数字n往下排，找n-1或者n+1有没有出现，选出现次数更多的一个，以此类推。
solution里面的【Approach 4: Using HashMap】和这种方法很像，但是码更简单。主要区别在最后一步。
另外在建map的时候可以用getOrDefault( )快速查找。

答案

按照solution的方法改之后答案和solution提供的很像

public int findLHS(int[] nums) {HashMap <Integer, Integer> count = new HashMap<>();for (int num: nums){count.put(num, count.getOrDefault(num, 0) + 1);}int len = 0;for (int key: count.keySet()){if (count.containsKey(key + 1)){len = Math.max(len, count.get(key) + count.get(key + 1));}}return len;}

Leet Code知识点总结 - 594相关推荐

Leet Code 力扣 - - 最短最优雅python解法带解析汇总
Leet Code 刷题笔记 - - 不求最快最省,但求最短最优雅前言代码精炼是 Python 的核心,同时能够反应对于语言的熟练程度,本项目目的在于汇总 leet code 最短最优雅的解法,拒 ...
Leet Code OJ 119. Pascal's Triangle II [Difficulty: Easy]
题目: Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return ...
Leet Code题解 - 1559. Detect Cycles in 2D Grid 检测二维无向图中的环
Leet Code题解 -- 1559. Detect Cycles in 2D Grid 检测二维无向图中的环前言一.题目描述二.思路整理 1. 审题 2. 分布实现步骤 2.1 将二维数组处 ...
leet code: Two Sum
leet code: Two Sum 题目 Given an array of integers, return indices of the two numbers such that they a ...
Leet Code OJ 刷题顺序参考
出现频度为5: 1. Leet Code OJ 1. Two Sum [Difficulty: Easy] 2. Leet Code OJ 8. String to Integer (atoi) ...
案例1：金融数据分析----code知识点详解版
案例1:金融数据分析----code详解版 1.引言 1.1案例分析目标 1.2涉及知识点 1.3案例分析流程 2.数据获取 `涉及知识点:` 2.1安装*tushare*库 2.2获取Token 2 ...
java遍历斐波纳契数列_详解循环、迭代、递归、分治(Leet Code 509 斐波那契数列)，实际运用...
Multiple solutions of Fibonacci (Python or Java) 本章是用英文写的,作为或想成为一名优秀的攻城狮,习惯阅读英文文档将使你受益良多.例如更好的查看最新版的 ...
Leet Code OJ 简单（二）
20. 有效括号 48ms class Solution:def isValid(self, s):""":type s: str:rtype: bool"& ...
Leet Code之Number of 1 bits
常规方法,一位一位右移,算出1的个数.但是最大的数有32个1,需要右移32次,效率较低. 常规方法: 1 int hammingWeight(uint32_t n) { 2 int k,num; 3 ...

Leet Code知识点总结 - 594

LeetCode 594. Longest Harmonious Subsequence

题目

思路

答案

Leet Code知识点总结 - 594相关推荐

最新文章

热门文章