摘要:
转自https://discuss.leetcode.com/topic/49771/java-simple-easy-understand-solution-with-explanation/2,注意里面对于减法的讲解 have been confused about bit manipulati 阅读全文
摘要:
Reference: https://discuss.leetcode.com/topic/48875/accepted-c-codes-with-explanation-and-references/2 The naive solution is brute-force, which is O(( 阅读全文
摘要:
Analysis: A number of unique digits is a number which is a combination of unrepeated digits. So, we can calculate the total number. for number with n 阅读全文
摘要:
注意需要maintain一个time stamp, 每次postTweet时++。还有要注意unfollow的时候,不能unfollow自己 关于PriorityQueue还看到这一种写法,挺简单的: 1 Set<Integer> users = userMap.get(userId).follow 阅读全文