2017年1月26日
leetcode笔记 201. Bitwise AND of Numbers Range
摘要： The key point: reduce n by removing the rightest '1' bit until n<=m; (1)if n>m,suppose m = yyyzzz, n = xxx100, because m is less than n, m can be equa 阅读全文
posted @ 2017-01-26 17:15 闲人五衰 阅读(716) 评论(0) 推荐(0) 编辑