随笔分类 -  leetcode_array

leetcode中array类型题目解法
摘要: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-15 09:47 daniel456 阅读(83) 评论(0) 推荐(0) 编辑
摘要: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-15 09:44 daniel456 阅读(159) 评论(0) 推荐(0) 编辑
摘要: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-10-15 09:35 daniel456 阅读(132) 评论(0) 推荐(0) 编辑
摘要: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-10-15 09:03 daniel456 阅读(147) 评论(0) 推荐(0) 编辑
摘要: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 @ 2017-10-15 08:58 daniel456 阅读(129) 评论(0) 推荐(0) 编辑
摘要: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-10-15 08:50 daniel456 阅读(157) 评论(0) 推荐(0) 编辑
摘要: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-10-15 08:41 daniel456 阅读(131) 评论(0) 推荐(0) 编辑
摘要: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-10-14 21:47 daniel456 阅读(155) 评论(0) 推荐(0) 编辑
摘要: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-10-14 21:36 daniel456 阅读(107) 评论(0) 推荐(0) 编辑
摘要:Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文
posted @ 2017-10-14 21:34 daniel456 阅读(96) 评论(0) 推荐(0) 编辑
摘要:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文
posted @ 2017-10-14 21:24 daniel456 阅读(104) 评论(0) 推荐(0) 编辑
摘要:Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2017-10-14 21:22 daniel456 阅读(127) 评论(0) 推荐(0) 编辑
摘要:Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2017-10-14 21:16 daniel456 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2017-10-14 21:13 daniel456 阅读(135) 评论(0) 推荐(0) 编辑
摘要:[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 含义:要求计算杨辉三角第K行的元素,For example, given k = 3,Return [1,3,3,1]. 思路: 同https://www.cnblogs.com/wzj4858/p/76 阅读全文
posted @ 2017-10-14 21:05 daniel456 阅读(98) 评论(0) 推荐(0) 编辑
摘要:Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 阅读全文
posted @ 2017-10-14 20:28 daniel456 阅读(102) 评论(0) 推荐(0) 编辑
摘要:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文
posted @ 2017-10-14 20:26 daniel456 阅读(84) 评论(0) 推荐(0) 编辑
摘要:Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leadin 阅读全文
posted @ 2017-10-14 20:20 daniel456 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2, 阅读全文
posted @ 2017-10-14 20:12 daniel456 阅读(122) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2017-10-14 20:09 daniel456 阅读(89) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示