LeetCode-524. Longest Word in Dictionary through Deleting [C++][Java]

LeetCode-524. Longest Word in Dictionary through DeletingLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/

题目描述

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

Example 1:

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

Example 2:

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

Constraints:

  • 1 <= s.length <= 1000
  • 1 <= dictionary.length <= 1000
  • 1 <= dictionary[i].length <= 1000
  • s and dictionary[i] consist of lowercase English letters.

解题思路

【C++】

class Solution {
public:
    string findLongestWord(string s, vector<string>& dictionary) {
        string res;
        for (string p : dictionary) {
            int i = 0, j = 0;
            while (j < s.size() && i < p.size()) {if (s[j++] == p[i]) {i++;}}
            if (i < p.size()) {continue;}
            if (p.size() > res.size()) res = p;
            else if (p.size() == res.size()) {res = min(res, p);}
        }
        return res;
    }
};

【Java】

class Solution {
    public String findLongestWord(String s, List<String> dictionary) {
        String res = "";
        for(String p : dictionary) {
            int pi = 0, sj = 0;
            while (sj < s.length() && pi < p.length()) {
                if(s.charAt(sj++) == p.charAt(pi)) {pi++;}
            }
            if (pi < p.length()) {continue;}
            if (p.length() > res.length()
                    || (p.length() == res.length() && res.compareTo(p) > 0)) {
                res = p;
            }
        }
        return res;
    }
}

参考文献

【1】Java compare方法和compareTo方法_lonelyVM的博客-CSDN博客_compare java

【2】Java CompareTo方法使用及详解_流浪年华的博客-CSDN博客_compareto方法

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

贫道绝缘子

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值