two pointer
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
1358. Number of Substrings Containing All Three Characters
Given a stringsconsisting only of charactersa,bandc.Return the number of substrings containingat leastone occurrence of all these charactersa,bandc.Example 1:Input: s = "abcabc"...原创 2020-02-29 19:24:46 · 336 阅读 · 0 评论 -
1208. Get Equal Substrings Within Budget
You are given two stringssandtof the same length. You want to changestot. Changing thei-th character ofstoi-th character oftcosts|s[i] - t[i]|that is, the absolute difference between th...原创 2019-10-07 16:11:36 · 186 阅读 · 0 评论 -
1040. Moving Stones Until Consecutive II
On aninfinitenumber line, the position of the i-th stone is given bystones[i]. Call a stone anendpoint stoneif it has the smallest or largest position.Each turn, you pick up an endpoint stone ...原创 2019-05-05 14:44:56 · 730 阅读 · 0 评论 -
1004. Max Consecutive Ones III
Given an arrayAof 0s and 1s, we may change up toKvalues from 0 to 1.Return the length of the longest (contiguous) subarray that contains only 1s.Example 1:Input: A = [1,1,1,0,0,0,1,1,1,...原创 2019-03-03 12:39:51 · 148 阅读 · 0 评论 -
992. Subarrays with K Different Integers
Given an array A of positive integers, call a (contiguous, not necessarily distinct) subarray of A good if the number of different integers in that subarray is exactly K.(For example, [1,2,3,1,2] ha...原创 2019-02-10 15:00:39 · 897 阅读 · 0 评论 -
978. Longest Turbulent Subarray
A subarray A[i], A[i+1], ..., A[j] of A is said to be turbulent if and only if:For i <= k < j, A[k] > A[k+1] when k is odd, and A[k] < A[k+1] when k is even; OR, for i <= k < j, A...原创 2019-01-20 12:00:19 · 257 阅读 · 0 评论 -
974. Subarray Sums Divisible by K
Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K. Example 1:Input: A = [4,5,0,-2,-3,1], K = 5Output: 7Explanation: There are...原创 2019-01-13 12:00:46 · 212 阅读 · 0 评论 -
948. Bag of Tokens
You have an initial power P, an initial score of 0 points, and a bag of tokens.Each token can be used at most once, has a value token[i], and has potentially two ways to use it.If we have at least...原创 2018-11-25 12:39:37 · 133 阅读 · 0 评论 -
927. Three Equal Parts
Given an array A of 0s and 1s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value.If it is possible, return any [i, j] with i+1 < j, such that:...原创 2018-10-21 11:05:52 · 282 阅读 · 0 评论 -
904. Fruit Into Baskets
In a row of trees, the i-th tree produces fruit with type tree[i].You start at any tree of your choice, then repeatedly perform the following steps:Add one piece of fruit from this tree to your ba...原创 2018-09-16 11:19:36 · 552 阅读 · 0 评论 -
209. Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.Example: Input: s = 7, ...原创 2018-08-27 20:05:48 · 118 阅读 · 0 评论 -
862. Shortest Subarray with Sum at Least K
Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K.If there is no non-empty subarray with sum at least K, return -1. Example 1:Input: A = [1], K = 1Output: 1E...原创 2018-07-01 12:08:07 · 679 阅读 · 0 评论 -
438. Find All Anagrams in a String
Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.Strings consists of lowercase English letters only and the length of both strings s and p will not be lar原创 2018-02-06 10:23:26 · 222 阅读 · 0 评论 -
457. Circular Array Loop
You are given an array of positive and negative integers. If a number n at an index is positive, then move forward n steps. Conversely, if it's negative (-n), move backward n steps. Assume the first e原创 2018-01-13 15:28:33 · 612 阅读 · 0 评论 -
30. Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and原创 2017-09-04 20:29:50 · 226 阅读 · 0 评论 -
658. Find K Closest Elements
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always prefe...原创 2017-11-09 17:52:36 · 356 阅读 · 0 评论