![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HaspMap
Opium_Z
这个作者很懒,什么都没留下…
展开
-
LeetCode 138 Copy List with Random Pointer
Problem: A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Analyse: First of all, we should know what is deep copy and...原创 2019-03-30 05:45:21 · 108 阅读 · 0 评论 -
Leetcode 219 Contains Duplicate II
Problem: Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at...原创 2019-04-04 12:13:29 · 99 阅读 · 0 评论 -
LeetCode 496 - Next Greater Element I
quesion: Analysis: Two methods: brute force: find the poistion of each element of nums1 in nums2 search nums2 until find, or set as -1 time complexity O(nm), space O(m) stack ,hashmap fInd eac...原创 2019-06-06 01:12:36 · 104 阅读 · 0 评论