2017年9月25日
lintcode584- Drop Eggs II- medium
摘要： There is a building of n floors. If an egg drops from the k th floor or above, it will break. If it's dropped from any floor below, it will not break. 阅读全文
posted @ 2017-09-25 08:25 jasminemzy 阅读(359) 评论(0) 推荐(0) 编辑
lintcode254- Drop Eggs- easy
摘要： There is a building of n floors. If an egg drops from the k th floor or above, it will break. If it's dropped from any floor below, it will not break. 阅读全文
posted @ 2017-09-25 08:12 jasminemzy 阅读(440) 评论(0) 推荐(0) 编辑
lintcode462- Total Occurrence of Target- easy
摘要： Given a target number and an integer array sorted in ascending order. Find the total number of occurrences of target in the array. Example Given [1, 3 阅读全文
posted @ 2017-09-25 04:58 jasminemzy 阅读(170) 评论(0) 推荐(0) 编辑
2017年9月24日
lintcode63- Search in Rotated Sorted Array II- medium
摘要： Follow up for Search in Rotated Sorted Array: What if duplicates are allowed? Would this affect the run-time complexity? How and why? Write a function 阅读全文
posted @ 2017-09-24 09:23 jasminemzy 阅读(121) 评论(0) 推荐(0) 编辑
lintcode62- Search in Rotated Sorted Array- medium
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target va 阅读全文
posted @ 2017-09-24 09:13 jasminemzy 阅读(109) 评论(0) 推荐(0) 编辑
2017年9月23日
lintcode74- First Bad Version- medium
摘要： The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the fo 阅读全文
posted @ 2017-09-23 07:46 jasminemzy 阅读(112) 评论(0) 推荐(0) 编辑
lintcode75- Find Peak Element- medium
摘要： There is an integer array which has the following features: The numbers in adjacent positions are different. A[0] < A[1] && A[A.length - 2] > A[A.leng 阅读全文
posted @ 2017-09-23 07:31 jasminemzy 阅读(91) 评论(0) 推荐(0) 编辑
lintcode160- Find Minimum in Rotated Sorted Array II- medium
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. 阅读全文
posted @ 2017-09-23 06:46 jasminemzy 阅读(82) 评论(0) 推荐(0) 编辑
lintcode159- Find Minimum in Rotated Sorted Array- medium
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. 阅读全文
posted @ 2017-09-23 05:43 jasminemzy 阅读(109) 评论(0) 推荐(0) 编辑
lintcode447- Search in a Big Sorted Array- medium
摘要： Given a big sorted array with positive integers sorted by ascending order. The array is so big so that you can not get the length of the whole array d 阅读全文
posted @ 2017-09-23 05:23 jasminemzy 阅读(112) 评论(0) 推荐(0) 编辑