上一页 1 2 3 4 5 6 7 ··· 14 下一页
2020年3月31日
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 @ 2020-03-31 16:27 米开朗菠萝 阅读(89) 评论(0) 推荐(0)
485. Max Consecutive Ones
摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two di 阅读全文
posted @ 2020-03-31 15:28 米开朗菠萝 阅读(91) 评论(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 @ 2020-03-31 15:20 米开朗菠萝 阅读(99) 评论(0) 推荐(0)
2020年3月30日
414. Third Maximum Number
摘要： Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexi 阅读全文
posted @ 2020-03-30 12:08 米开朗菠萝 阅读(154) 评论(0) 推荐(0)
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. Example 1: Input: [3,0,1] Output 阅读全文
posted @ 2020-03-30 11:38 米开朗菠萝 阅读(118) 评论(0) 推荐(0)
2020年3月29日
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 @ 2020-03-29 20:57 米开朗菠萝 阅读(103) 评论(0) 推荐(0)
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 @ 2020-03-29 20:04 米开朗菠萝 阅读(107) 评论(0) 推荐(0)
189. Rotate Array
摘要： Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: [1,2,3,4,5,6,7] and k = 3 Output: [5,6,7,1,2,3,4] 阅读全文
posted @ 2020-03-29 19:59 米开朗菠萝 阅读(141) 评论(0) 推荐(0)
860. Lemonade Change
摘要： At a lemonade stand, each lemonade costs $5. Customers are standing in a queue to buy from you, and order one at a time (in the order specified by bil 阅读全文
posted @ 2020-03-29 17:49 米开朗菠萝 阅读(135) 评论(0) 推荐(0)
763. Partition Labels
摘要： A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one p 阅读全文
posted @ 2020-03-29 17:20 米开朗菠萝 阅读(179) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 ··· 14 下一页