12 2017 档案

算法--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-12-20 16:53 Derek丶D 阅读(158) 评论(0) 推荐(0) 编辑
算法--leetcode 728. Self Dividing Numbers
摘要：题目： A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0,  阅读全文
posted @ 2017-12-17 15:22 Derek丶D 阅读(112) 评论(0) 推荐(0) 编辑
算法--leetcode 657. Judge Route Circle
摘要：题目： Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to th 阅读全文
posted @ 2017-12-15 18:01 Derek丶D 阅读(109) 评论(0) 推荐(0) 编辑
算法--leetcode 461. Hamming Distance in Python
摘要：题目： The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, ca 阅读全文
posted @ 2017-12-14 21:41 Derek丶D 阅读(139) 评论(0) 推荐(0) 编辑