leetcode524~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:
All the strings in the input will only contain lower-case letters.
The size of the dictionary won't exceed 1,000.
The length of all the strings in the input won't exceed 1,000.

没有想到什么好的解法,只能暴力求解,如果哪位大神有idea,望告之~~

public class LongestWordinDictionarythroughDeleting524 {
    //暴力求解
    //遍历d中的每个字符串,依次与s进行比较
    public String findLongestWord(String s, List<String> d) {
        //排序之后,保证字典序输出
        Collections.sort(d);
        String result="";
        for(String dd : d) {
            int i=0,j=0;
            while(i<s.length()&&j<dd.length()) {
                if(s.charAt(i)==dd.charAt(j)) {
                    i++;
                    j++;
                } else {
                    i++;
                }
            }
            if(j==dd.length()&& result.length()<dd.length()) {
                result = dd;
            }
        }
        return result;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值