2017年7月4日
【leetcode】476. Number Complement
摘要： 原题： Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation. Note: The given 阅读全文
posted @ 2017-07-04 23:29 l.shane 阅读(155) 评论(0) 推荐(0)
【leetcode】561. Array Partition I
摘要： 原题： 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 阅读全文
posted @ 2017-07-04 21:58 l.shane 阅读(228) 评论(0) 推荐(0)