leetcode 524 - 通过删除字母匹配到字典里最长单词

题目: https://leetcode.cn/problems/longest-word-in-dictionary-through-deleting/
程序目录结构如下，

CMakeLists.txt

cmake_minimum_required(VERSION 2.6)

project(longest_word_in_dict_through_deleting)
set(CMAKE_CXX_STANDARD 20)
add_definitions(-g)

include_directories(${CMAKE_CURRENT_SOURCE_DIR}/../../../include)
string(REPLACE ".cpp" "" file "main.cpp")
add_executable(${file}  "main.cpp")

main.cpp

#include "printer/printer.hpp"

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

class Solution {
public:
    // 有两个条件:
    // 1. t是s的子串
    // 2. t是s的最长子串，或者t是s的字母序最小子串
    string findLongestWord(string s, vector<string>& dictionary) {
        string res {""};
        for(auto t: dictionary) {
            int i{0}, j{0};
            while(i<t.size() && j<s.size()) {
                if(t[i] == s[j]) {
                    ++i;
                }
                ++j;
            }
            if(i==t.size()) {
                // 两种情况，新出的t比res长
                // 新出的t和res一样长，但是字母序比较小
                // 此两种情况更新res
                if((t.size()> res.size()) || (t.size() == res.size() && (t < res))) {
                    res = t;
                }
            }
        }
        return res;
    }   
};

auto main(int argc, char** argv) -> int {
    Solution s;
    string source_s {"abpcplea"};
    vector<string> dicts {"ale","apple","monkey","plea"};
    auto word = s.findLongestWord(source_s, dicts);
    cout << "Longest word in " << source_s << ": " << word << "\n";
    return EXIT_SUCCESS;
}

程序输出如下，