Python 刷Leetcode题库，顺带学英语单词（50）

Sliding Window Maximum

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. Return the max sliding window.   [#239]

   Example:

Input: nums = [1,3,-1,-3,5,3,6,7], and k = 3
    Output: [3,3,5,5,6,7]
    Explanation:
    Window position         Max
    ---------------                 -----
    [1 3 -1] -3 5 3 6 7        3
    1 [3 -1 -3] 5 3 6 7        3
    1 3 [-1 -3 5] 3 6 7        5
    1 3 -1 [-3 5 3] 6 7        5
    1 3 -1 -3 [5 3 6] 7        6
    1 3 -1 -3 5 [3 6 7]        7

Note:

You may assume k is always valid, 1 ≤ k ≤ input array's size for non-empty array.

Follow up:

Could you solve it in linear time?

Valid Anagram

Given two strings s and t , write a function to determine if t is an anagram of s.    [#242]

   Examples:

Input: s = "anagram", t = "nagaram"
    Output: true
    Input: s = "rat", t = "car"
    Output: false

Note:

You may assume the string contains only lowercase alphabets.

Follow up:

What if the inputs contain unicode characters? How would you adapt your solution to such case?