热爱编程，热爱技术

4.Median of Two Sorted Arrays Hard There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assumenums1andnums2cannot be bot...

560.Subarray Sum Equals K（题目链接） Medium Given an array of integers and an integerk, you need to find the total number of continuous subarrays whose sum equals tok. Example 1: Input:nums = [1,1,1], k = 2 Output: 2 Constraints: The length of the...

13.Roman to Integer Easy Roman numerals are represented by seven different symbols:I,V,X,L,C,DandM. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 Fo...

819.Most Common Word Easy Given a paragraphand a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn't banned, and that the answer is unique. Words in the l...

20.Valid Parentheses Easy Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets mus...

387.First Unique Character in a String Easy Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note:You may assum...

273.Integer to English Words Hard Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231- 1. Example 1: Input: 123 Output: "One Hundred Twenty Three" Example 2: Input: 12345 Output: "Twe..

76.Minimum Window Substring Hard Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOBECODEBANC", T = "ABC" Output: "BANC" Note: If there is no such w.

937.Reorder Data in Log Files Easy You have an array oflogs. Each log is a space delimited string of words. For each log, the first word in each log is an alphanumericidentifier. Then, either: Each word after the identifier will consist only of lo...

16.3Sum Closest Given an arraynumsofnintegers and an integertarget, find three integers innumssuch that the sum is closest totarget. Return the sum of the three integers. You may assume that...

3.Longest Substring Without Repeating Characters Medium 7654450Add to ListShare Given a string, find the length of thelongest substringwithout repeating characters. Example 1: Input: "abcabcb...

287.Find the Duplicate Number Given an arraynumscontainingn+ 1 integers where each integer is between 1 andn(inclusive), prove that at least one duplicate number must exist. Assume that there i...

参考https://blog.csdn.net/lym940928/article/details/89674125 //顺时针旋转90度 /* * clockwise rotate * first reverse up to down, then swap the symmetry * 1 2 3 7 8 9 7 4 1 * 4 5 6 => 4 5 ...

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] in...

283.Move Zeroes Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,...

78.Subsets Given a set ofdistinctintegers,nums, return all possible subsets (the power set). Note:The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: ...

1.当对一个数组要求以O(n)的时间复杂度去实现的时候，大部分情况下需要对数组进行一下预处理，或者程序中包含多个O(n)的for循环 2.对数组的处理，如果需要用到之前数组的信息，也就是说后面更新的数组信息跟之前信息有关，处理方法往往是从无到有，比如从最左边开始往右递增，或者从最右边开始往左递增。 ...

238.Product of Array Except Self Given an arraynumsofnintegers wheren> 1, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i]. Ex...

53.Maximum Subarray Given an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4...

34.Find First and Last Position of Element in Sorted Array Given an array of integersnumssorted in ascending order, find the starting and ending position of a giventargetvalue. Your algorith...

33.Search in Rotated Sorted Array Medium Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e.,[0,1,2,4,5,6,7]might become[4,5,6,7,0,1,2]). You a...

31.Next Permutation Implementnext permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as...

Given an arraynumsofnintegers, are there elementsa,b,cinnumssuch thata+b+c= 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not cont...

Given an array of integers, returnindicesof the two numbers such that they add up to a specific target. You may assume that each input would haveexactlyone solution, and you may not use thesame...

解： 辅助图片： class Solution { public: int trap(vector<int>& height) { int value=0; int cnt = height.capacity(); int maxIndex = 0; int sum = 0; ...

4.Median of Two Sorted Arrays There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+...

std::remove(begin, end, value) 该函数移除一个从begin到end位置，值等于value的数据。这个函数只是通过指针的移动来完成删除操作，将不等于value的值放到链表的最前端，然后返回一个指向新的尾值的迭代器（比如，[1,2,3,4,2], 最后会指向index=3,0是第一个元素）。 std::distance(begin, end); 返回begin与end...