Array
ep_mashiro
日拱一卒,功不唐捐
展开
-
Leetcode_Minimum Size Subarray Sum
Tag Array\Two Pointers\Binary Search Difficulty Medium Description Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum原创 2017-02-27 20:26:48 · 260 阅读 · 0 评论 -
Leetcode_Two Sum II - Input array is sorted
Tag Array\Two Pointers\Binary Search Difficulty Easy Description Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target n原创 2017-02-27 11:08:56 · 261 阅读 · 0 评论 -
Leetcode_Best Time to Buy and Sell Stock II
Tag Array\Greedy Difficulty Easy Description 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原创 2017-02-27 11:16:21 · 244 阅读 · 0 评论 -
Leetcode_Best Time to Buy and Sell Stock
Tag Array/Dynamic Programming Difficulty Easy Description 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 on原创 2017-02-27 12:18:50 · 429 阅读 · 0 评论 -
Leetcode_Pascal's Triangle II
Tag Array Difficulty Easy Description Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]. Code 杨辉三角形,直观解答class Solution(object): def原创 2017-02-27 12:35:26 · 242 阅读 · 0 评论 -
Leetcode_Merge Sorted Array
Tag Array Difficulty Easy Description 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 that is原创 2017-02-27 12:43:19 · 261 阅读 · 0 评论 -
Leetcode_Plus One
Tag Array\Math Difficulty Easy Description 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 leading原创 2017-02-27 12:46:40 · 271 阅读 · 0 评论 -
Leetcode_Maximum Subarray
Tag Array\Dynamic Programming\Divide and Conquer Difficulty Easy Description Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example,原创 2017-02-27 13:15:45 · 246 阅读 · 0 评论 -
Leetcode_Search Insert Position
Tag Array/Binary Search Difficulty Easy Description 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原创 2017-02-27 13:20:08 · 217 阅读 · 0 评论 -
Leetcode_Combination Sum III
Tag Array\Backtracking Difficulty Medium Description Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination sho原创 2017-02-27 13:59:57 · 263 阅读 · 0 评论 -
Leetcode Array知识点总结
804. Unique Morse Code Words:统计单词翻译成摩斯电码后摩斯电码的个数,Easy set class Solution(object): def uniqueMorseRepresentations(self, words): """ :type words: List[str] :rtype...原创 2018-04-18 09:46:49 · 292 阅读 · 0 评论 -
Leetcode_Majority Element
Tag Array/Divide and Conquer/Bit Manipulation Difficulty Easy Description Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ ti原创 2017-02-27 11:00:09 · 239 阅读 · 0 评论 -
Leetcode_Rotate Array
Tag Array Difficulty Easy Description 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]. Codeclas原创 2017-02-26 15:58:50 · 235 阅读 · 0 评论 -
Leetcode_Contains Duplicate
Tag Array,Hash Table Difficulty Easy Description 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原创 2017-02-26 14:30:25 · 268 阅读 · 0 评论 -
Leetcode_Search for a Range
Tag Binary Search\Array Difficulty Medium Description Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime c原创 2017-02-27 20:29:32 · 289 阅读 · 0 评论 -
Leetcode_Combination Sum
Tag Array\Backtracking Difficulty Medium Description Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate number原创 2017-02-27 20:33:06 · 285 阅读 · 0 评论 -
Leetcode_Array_Max Consecutive Ones
Tag: Array Difficulty: Easy Description: 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 d原创 2017-02-26 13:46:41 · 232 阅读 · 0 评论 -
Leetcode_Array_Find All Numbers Disappeared in an Array
Tag: Array Difficulty: Easy Description: 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] inclu原创 2017-02-26 13:50:21 · 247 阅读 · 0 评论 -
Leetcode_Kth Largest Element in an Array
Tag: Array、Heap、Divide and Conquer Difficulty: Medium Description: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distin原创 2017-02-26 13:53:58 · 254 阅读 · 0 评论 -
Leetcode_Third Maximum Number
Tag: Array Difficult: Easy Description: 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 complexity must原创 2017-02-26 13:51:39 · 212 阅读 · 0 评论 -
Leetcode_Move Zeroes
Tag: Array、Two Pointers Difficulty: Medium Description: 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 e原创 2017-02-26 13:56:38 · 201 阅读 · 0 评论 -
Leetcode_Missing Number
Tag:Array,Math,Bit Manipulation Difficulty: Easy 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原创 2017-02-26 14:14:23 · 223 阅读 · 0 评论 -
Leetcode_Contains Duplicate II
Tag:Array,Hash Table **Difficulty: **Easy Description: 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]原创 2017-02-26 14:23:52 · 263 阅读 · 0 评论 -
Leetcode Array 知识点总结
832. Flipping an Image:将数据先水平翻转,再01交换,返回数据。Easyclass Solution(object): def flipAndInvertImage(self, A): """ :type A: List[List[int]] :rtype: List[List[int]] "...原创 2018-05-16 10:42:26 · 378 阅读 · 0 评论