摘要：
Fun one.. the punch line of this problem is quite common in Bit related problems on HackerRank - visualize it in your mind, and you will find: all bit 阅读全文
posted @ 2017-01-06 12:19
Tonix
阅读(111)
评论(0)
推荐(0)
摘要：
My first reaction is to have an unlimited length of bit-array, to mark existence. But if no extra mem is allowed, we can simply use 'sign' on each ind 阅读全文
posted @ 2017-01-06 08:31
Tonix
阅读(115)
评论(0)
推荐(0)
摘要：
The follow-up question is fun: "Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?" When we meet 阅读全文
posted @ 2017-01-06 07:11
Tonix
阅读(132)
评论(0)
推荐(0)
浙公网安备 33010602011771号