zoukankan      html  css  js  c++  java
  • LeetCode 76. Minimum Window Substring

    https://leetcode.com/problems/minimum-window-substring/description/

    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).

    For example,
    S = "ADOBECODEBANC"
    T = "ABC"

    Minimum window is "BANC".

    Note:
    If there is no such window in S that covers all characters in T, return the empty string "".

    If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.


    • 字符串中等题。Sliding window algorithm + Hash。
    • 设置window start/end,  扩展end去找到符合条件的window,找到之后再扩展start来缩小window找到min window substring。
     1 //
     2 //  main.cpp
     3 //  LeetCode
     4 //
     5 //  Created by Hao on 2017/3/16.
     6 //  Copyright © 2017年 Hao. All rights reserved.
     7 //
     8 
     9 #include <iostream>
    10 #include <vector>
    11 #include <unordered_map>
    12 using namespace std;
    13 
    14 class Solution {
    15 public:
    16     string minWindow(string s, string t) {
    17         if (s.empty() || t.empty()) return "";
    18         
    19         string sResult;
    20         unordered_map<char, int> hash;
    21         
    22         for (auto & ch : t)
    23             ++ hash[ch];
    24         
    25         // window start/end, sum{positive hash[i]}, min window size
    26         int left = 0, right = 0, count = t.size(), len = INT_MAX;
    27         
    28         while (right < s.size()) {
    29             if (hash[s.at(right)] > 0)
    30                 -- count;
    31             
    32             -- hash[s.at(right)];
    33             
    34             ++ right;
    35             
    36             // found the valid window
    37             while (0 == count) {
    38                 if (right - left < len) { // find the min window
    39                     len = right - left;
    40                     sResult = s.substr(left, len);
    41                 }
    42                 
    43                 // move window left to minimize window, and restore hash value/count when kick out left point
    44                 if (hash[s.at(left)] >= 0)
    45                     ++ count;
    46                 
    47                 ++ hash[s.at(left)];
    48                 
    49                 ++ left;
    50             }
    51         }
    52         
    53         if (len == INT_MAX)
    54             sResult = "";
    55         
    56         return sResult;
    57     }
    58 };
    59 
    60 int main(int argc, char* argv[])
    61 {
    62     Solution    testSolution;
    63     
    64     vector<string>  sInputs = {"ADOBECODEBANC", "", "A", "ABC"};
    65     vector<string>  tInputs = {"ABC", "A", "", "DEF"};
    66     string          result;
    67     
    68     /*
    69      "BANC"
    70      ""
    71      ""
    72      ""
    73      */
    74     for (auto i = 0; i < sInputs.size(); ++ i) {
    75         result = testSolution.minWindow(sInputs[i], tInputs[i]);
    76         cout << """ << result << """ << endl;
    77     }
    78     
    79     return 0;
    80 }
    View Code
  • 相关阅读:
    easyUI之tree
    MSSQL索引优化
    MongoDB学习笔记(一) MongoDB介绍及安装
    项目经理必备的11种人际关系技能
    http协议详细介绍
    ERP存储过程
    UVA1339 UVALive3213 POJ2159 ZOJ2658 Ancient Cipher【密码】
    UVA1588 UVALive3712 POJ3158 Kickdown
    UVA1588 UVALive3712 POJ3158 Kickdown
    UVA10340 POJ1936 ZOJ1970 All in All【字符串匹配】
  • 原文地址:https://www.cnblogs.com/pegasus923/p/8446208.html
Copyright © 2011-2022 走看看