Beserious - 博客园

2017年7月29日

leetcode 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-07-29 12:41 Beserious 阅读(131) 评论(0) 推荐(0) 编辑

leetcode 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-07-29 10:17 Beserious 阅读(371) 评论(0) 推荐(0) 编辑

leetcode 219. Contains Duplicate II

摘要： Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the 阅读全文

posted @ 2017-07-29 09:35 Beserious 阅读(148) 评论(0) 推荐(0) 编辑

2017年7月28日

leetcode 283. Move Zeroes

摘要： Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文

posted @ 2017-07-28 17:21 Beserious 阅读(150) 评论(0) 推荐(0) 编辑

leetcode 217. Contains Duplicate

摘要： Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr 阅读全文

posted @ 2017-07-28 16:34 Beserious 阅读(193) 评论(0) 推荐(0) 编辑

leetcode 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: 排序，然后前后枚举一下就行了 3种情况。或阅读全文

posted @ 2017-07-28 16:22 Beserious 阅读(141) 评论(0) 推荐(0) 编辑

leetcode 268. Missing Number

摘要： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example,Given nums = [0, 1, 阅读全文

posted @ 2017-07-28 16:03 Beserious 阅读(140) 评论(0) 推荐(0) 编辑

448. Find All Numbers Disappeared in an Array

摘要： Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] 阅读全文

posted @ 2017-07-28 15:58 Beserious 阅读(145) 评论(0) 推荐(0) 编辑

leetcode 485. Max Consecutive Ones

摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文

posted @ 2017-07-28 12:09 Beserious 阅读(143) 评论(0) 推荐(0) 编辑

496. Next Greater Element I

摘要： You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1' 阅读全文

posted @ 2017-07-28 11:39 Beserious 阅读(132) 评论(0) 推荐(0) 编辑