zoukankan      html  css  js  c++  java
  • 524. Longest Word in Dictionary through Deleting

    Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.

    Example 1:

    Input:
    s = "abpcplea", d = ["ale","apple","monkey","plea"]
    
    Output: 
    "apple"
    

    Example 2:

    Input:
    s = "abpcplea", d = ["a","b","c"]
    
    Output: 
    "a"
    

    Note:

    1. All the strings in the input will only contain lower-case letters.
    2. The size of the dictionary won't exceed 1,000.
    3. The length of all the strings in the input won't exceed 1,000.
     AC code:
    class Solution {
    public:
        string findLongestWord(string s, vector<string>& d) {
            string ans = "";
            string temp;
            sort(d.begin(), d.end());
            for (int i = 0; i < d.size(); ++i) {
                temp = helper(s, d[i]);
                ans = temp.length() > ans.length() ? temp : ans;
            }
            return ans;
        }
        
    private:
        string helper(string s, string d) {
            int len = s.length();
            int i, j;
            for (i = 0, j = 0; i < len && j < s.length();) {
                if (s[i] == d[j]) i++, j++;
                else i++;
            }
            if (j == d.length()) return d;
            else return "";
        }
    };
    

    Runtime: 76 ms, faster than 58.66% of C++ online submissions for Longest Word in Dictionary through Deleting.

    Approach #2:Using Java without sort

    public class Solution {
        public boolean isSubsequence(String x, String y) {
            int j = 0;
            for (int i = 0; i < y.length() && j < x.length(); i++)
                if (x.charAt(j) == y.charAt(i))
                    j++;
            return j == x.length();
        }
        public String findLongestWord(String s, List < String > d) {
            String max_str = "";
            for (String str: d) {
                if (isSubsequence(str, s)) {
                    if (str.length() > max_str.length() || (str.length() == max_str.length() && str.compareTo(max_str) < 0))
                        max_str = str;
                }
            }
            return max_str;
        }
    }
    
    Runtime: 18 ms, faster than 90.03% of Java online submissions for Longest Word in Dictionary through Deleting.
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    渗透前期准备--信息收集
    sqlmap极其详细查询文档
    namp常用测试脚本记录
    队列的基础使用
    线程与非线程示例
    爬虫--多线程编程-提高效率--泛见(犯贱)志趣图标题和链接爬取
    requests模块代理使用、post数据传输使用、get参数传输
    pytesseract模块验证码图片识别
    课时72.子元素选择器(掌握)
    课时71.后代选择器(掌握)
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9880127.html
Copyright © 2011-2022 走看看