![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
哈希表
哈希表
Haha@25
300字以内
展开
-
141. 环形链表(双指针)(哈希表)
方法一:哈希表/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */pub...原创 2020-02-16 16:57:58 · 129 阅读 · 0 评论 -
128. Longest Consecutive Sequence(回顾)
·1原创 2020-01-23 19:04:08 · 57 阅读 · 0 评论 -
594. Longest Harmonious Subsequence
方法一,枚举class Solution { public int findLHS(int[] nums) { int cnt = 0,res = 0; boolean flag = false; for(int i = 0;i<nums.length;i++) { for(int j = 0...原创 2020-01-23 18:17:01 · 61 阅读 · 0 评论 -
217. Contains Duplicate
方法一:用哈希表class Solution { public boolean containsDuplicate(int[] nums) { Map<Integer,Integer> map = new HashMap<>(); for(int i = 0;i<nums.length;i++) { ...原创 2020-01-23 16:44:04 · 88 阅读 · 0 评论 -
1. Two Sum
方法一:两次循环(o(n2))class Solution { public int[] twoSum(int[] nums, int target) { for(int i = 0;i<nums.length;i++){ for(int j = i+1;j<nums.length;j++){ ...原创 2020-01-23 15:09:54 · 96 阅读 · 0 评论