- 博客(3)
- 收藏
- 关注
原创 leetcode整理
二刷了,一刷做完了easy部分,做了一点medium,再刷一遍做好总结。EasyNOTITLESOLUTION461Hamming Distance题解561Array Partition I题解
2017-06-02 21:29:59 405
原创 leetcode-561(Array Partition I)
DecriptionGiven an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1
2017-06-02 10:58:27 886
原创 leetcode-461(Hamming Distance)
DescriptionThe Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.
2017-06-02 10:43:21 421
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人