leetcode
qq_16095953
这个作者很懒,什么都没留下…
展开
-
leetcode 学习打卡贴
从一个低级程序媛做起,从easy开始,每天一道leetcode,先自己写,不行的话再去看参考。2015.6.19,做完三道入门题时的突发奇想。原创 2015-06-19 09:37:24 · 173 阅读 · 0 评论 -
Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most原创 2015-06-19 10:29:51 · 136 阅读 · 0 评论