- 博客(2)
- 收藏
- 关注
原创 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 132
原创 leetcode 学习打卡贴
从一个低级程序媛做起,从easy开始,每天一道leetcode,先自己写,不行的话再去看参考。2015.6.19,做完三道入门题时的突发奇想。
2015-06-19 09:37:24 164
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人