siriusli - 博客园

2019年2月10日

摘要： "191. Number of 1 Bits" 本题难度: Easy Topic: Bit Manipulation Description Write a function that takes an unsigned integer and return the number of '1' bi 阅读全文

posted @ 2019-02-10 14:09 siriusli 阅读(167) 评论(0) 推荐(0)

[Lintcode]2. Trailing Zeros

摘要： "2. Trailing Zeros" 本题难度: Easy Topic: Math&Bit Manipulation Description Write an algorithm which computes the number of trailing zeros in n factorial. 阅读全文

posted @ 2019-02-10 03:22 siriusli 阅读(164) 评论(0) 推荐(0)

[Lintcode]142. O(1) Check Power of 2

摘要： "142. O(1) Check Power of 2" 本题难度: Easy Topic: Math&Bit Manipulation Description Using O(1) time to check whether an integer n is a power of 2. Exampl 阅读全文

posted @ 2019-02-10 02:56 siriusli 阅读(149) 评论(0) 推荐(0)

[Lintcode]181. Flip Bits

摘要： "181. Flip Bits" 本题难度: Easy Topic: Math&Bit Manipulation Description Determine the number of bits required to flip if you want to convert integer n to 阅读全文

posted @ 2019-02-10 02:42 siriusli 阅读(117) 评论(0) 推荐(0)

[Lintcode]183. Wood Cut

摘要： "183. Wood Cut" 本题难度: Hard Topic: Binary Search Description Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to gua 阅读全文

posted @ 2019-02-10 02:15 siriusli 阅读(189) 评论(0) 推荐(0)

[Lintcode]61. Search for a Range/[Leetcode]34. Find First and Last Position of Element in Sorted Array

摘要： "[Lintcode]61. Search for a Range" / "[Leetcode]34. Find First and Last Position of Element in Sorted Array" 本题难度: Medium/Medium Topic: Binary Search 阅读全文

posted @ 2019-02-10 01:30 siriusli 阅读(173) 评论(0) 推荐(0)

[Leetcode]81. Search in Rotated Sorted Array II

摘要： "81. Search in Rotated Sorted Array II" 本题难度: Medium Topic: Binary Search 类似 "[Lintcode]62. Search in Rotated Sorted Array/[Leetcode]33. Search in Rot 阅读全文

posted @ 2019-02-10 01:09 siriusli 阅读(177) 评论(0) 推荐(0)

[Lintcode]62. Search in Rotated Sorted Array/[Leetcode]33. Search in Rotated Sorted Array

摘要： "[Lintcode]62. Search in Rotated Sorted Array" / "[Leetcode]33. Search in Rotated Sorted Array" 本题难度: Medium/Medium Topic: Binary Search Description 6 阅读全文

posted @ 2019-02-10 00:52 siriusli 阅读(201) 评论(0) 推荐(0)

2019年2月9日

[Lintcode]74. First Bad Version/[Leetcode]278. First Bad Version

摘要： "[Lintcode]74. First Bad Version" "[Leetcode]278. First Bad Version" 本题难度: [Lintcode]Medium/[Leetcode] Topic: Binary Search Description 我的代码 for Leet 阅读全文

posted @ 2019-02-09 02:32 siriusli 阅读(133) 评论(0) 推荐(0)

[Leetcode]162. Find Peak Element

摘要： "162. Find Peak Element" Description A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[ 阅读全文

posted @ 2019-02-09 01:41 siriusli 阅读(90) 评论(0) 推荐(0)

公告