摘要: Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return f 阅读全文
posted @ 2016-08-21 13:13 sfeiqiang 阅读(98) 评论(0) 推荐(0) 编辑
摘要: Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your 阅读全文
posted @ 2016-08-21 12:23 sfeiqiang 阅读(104) 评论(0) 推荐(0) 编辑
摘要: Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? 不用递归和循环,这里有一 阅读全文
posted @ 2016-08-21 00:11 sfeiqiang 阅读(131) 评论(0) 推荐(0) 编辑