摘要: TLE解法: AC解法: 可以将丑数分成三个队列 l1:1*2,2*2,3*2,4*2,5*2,6*2,8*2…… l2:1*3,2*3,3*3,4*3,5*3,6*3,8*3…… l3:1*5,2*5,3*5,4*5,5*5,6*5,8*5…… 每次从三个队列中拿出队头的数比较,最小的数为当前it 阅读全文
posted @ 2015-12-03 23:01 zhuoyu05 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive intege 阅读全文
posted @ 2015-12-03 21:57 zhuoyu05 阅读(130) 评论(0) 推荐(0) 编辑