2017年9月8日
349. Intersection of Two Arrays (Easy)
摘要： Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文
posted @ 2017-09-08 16:36 Yancea 阅读(108) 评论(0) 推荐(0)
453. Minimum Moves to Equal Array Elements (Easy)
摘要： Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n  阅读全文
posted @ 2017-09-08 16:06 Yancea 阅读(106) 评论(0) 推荐(0)
657. Judge Route Circle (Easy)
摘要： 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 the or 阅读全文
posted @ 2017-09-08 15:18 Yancea 阅读(175) 评论(0) 推荐(0)