- 博客(3)
- 收藏
- 关注
RSS订阅原创 leetcode整理
二刷了，一刷做完了easy部分，做了一点medium，再刷一遍做好总结。 Easy NO TITLE SOLUTION 461 Hamming Distance 题解 561 Array Partition I 题解
2017-06-02 21:29:59
401
原创 leetcode-561(Array Partition I)
Decription Given 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
881
原创 leetcode-461(Hamming Distance)
Description The 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
416
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人