S and T are strings composed of lowercase letters. In S, no letter occurs more than once.
S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.
Return any permutation of T (as a string) that satisfies this property.
1
2
3
4
5
6
7
8
Example:
Input:
S="cba"
T="abcd"
Output:"cbad"
Explanation:
"a","b","c"appear inS,so the order of"a","b","c"should be"c","b",and"a".
Since"d"does notappear inS,it can be at any position inT."dcba","cdba","cbda"are also valid outputs.
Note:
S has length at most 26, and no character is repeated in S.
Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of “chunks” (partitions), and individually sort each chunk. After concatenating them, the result equals the sorted array.
What is the most number of chunks we could have made?
Example 1:
1
2
3
4
5
Input:arr=[4,3,2,1,0]
Output:1
Explanation:
Splitting into two ormore chunks will notreturnthe required result.
Forexample,splitting into[4,3],[2,1,0]will result in[3,4,0,1,2],which isn'tsorted.
Example 2:
1
2
3
4
5
Input:arr=[1,0,2,3,4]
Output:4
Explanation:
We can split into two chunks,such as[1,0],[2,3,4].
However,splitting into[1,0],[2],[3],[4]isthe highest number of chunks possible.
Note:
arr will have length in range [1, 10].
arr[i] will be a permutation of [0, 1, ..., arr.length - 1].
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
Examples:
[2,3,4] , the median is 3
[2,3], the median is (2 + 3) / 2 = 2.5
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Your job is to output the median array for each window in the original array.
For example,
Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.
1
2
3
4
5
6
7
8
Window position Median
--------------------
[13-1]-353671
1[3-1-3]5367-1
13[-1-35]367-1
13-1[-353]673
13-1-3[536]75
13-1-35[367]6
Therefore, return the median sliding window as [1,-1,-1,3,5,6].
Note:
You may assume k is always valid, ie: k is always smaller than input array’s size for non-empty array.
Solution 0: Brute Force
Time complexity: O(n*klogk) TLE 32/42 test cases passed
Solution 1: Insertion Sort
Time complexity: O(k*logk + (n – k + 1)*k)
Space complexity: O(k)
C++ / vector
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Author: Huahua
// Running time: 99 ms
classSolution{
public:
vector<double>medianSlidingWindow(vector<int>& nums, int k) {
(Even though we are representing Intervals in the form [x, y], the objects inside are Intervals, not lists or arrays. For example, schedule[0][0].start = 1, schedule[0][0].end = 2, and schedule[0][0][0] is not defined.)
Also, we wouldn’t include intervals like [5, 5] in our answer, as they have zero length.
Note:
schedule and schedule[i] are lists with lengths in range [1, 50].