随笔分类 - Sliding Window
摘要:76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every chara
阅读全文
摘要:424. Longest Repeating Character Replacement You are given a string s and an integer k. You can choose any character of the string and change it to an
阅读全文
摘要:3. Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without repeating characters. Constraints
阅读全文
摘要:121. Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize
阅读全文