2017年10月26日
532. K-diff Pairs in an Array
摘要： Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an inte 阅读全文
posted @ 2017-10-26 19:51 bernieloveslife 阅读(149) 评论(0) 推荐(0)
561. Array Partition I
摘要： Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of 阅读全文
posted @ 2017-10-26 18:36 bernieloveslife 阅读(106) 评论(0) 推荐(0)
581. Shortest Unsorted Continuous Subarray
摘要： Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be 阅读全文
posted @ 2017-10-26 18:31 bernieloveslife 阅读(110) 评论(0) 推荐(0)
605. Can Place Flowers
摘要： Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they 阅读全文
posted @ 2017-10-26 15:32 bernieloveslife 阅读(137) 评论(0) 推荐(0)
628. Maximum Product of Three Numbers
摘要： Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Example 2: Note: 阅读全文
posted @ 2017-10-26 15:13 bernieloveslife 阅读(123) 评论(0) 推荐(0)
2017年10月23日
643. Maximum Average Subarray I
摘要： Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the 阅读全文
posted @ 2017-10-23 13:43 bernieloveslife 阅读(150) 评论(0) 推荐(0)
566. Reshape the Matrix
摘要： In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data. 阅读全文
posted @ 2017-10-23 13:36 bernieloveslife 阅读(137) 评论(0) 推荐(0)
2017年10月19日
661. Image Smoother
摘要： Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the ave 阅读全文
posted @ 2017-10-19 20:29 bernieloveslife 阅读(113) 评论(0) 推荐(0)
665. Non-decreasing Array
摘要： Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non-decr 阅读全文
posted @ 2017-10-19 15:32 bernieloveslife 阅读(163) 评论(0) 推荐(0)
674. Longest Continuous Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest continuous increasing subsequence. Example 1: Example 2: Note: Length of the array wil 阅读全文
posted @ 2017-10-19 15:17 bernieloveslife 阅读(191) 评论(0) 推荐(0)