524. Longest Word in Dictionary through Deleting

524. 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"

这里双指针用来判断是不是dictionary的子集,然后用一个比大小来遍历List就可以了。

class Solution {
    public String findLongestWord(String s, List<String> dictionary) {
        String longword = "";
        for ( String target : dictionary ){
            int l1 = longword.length(), l2 = target.length();
            if (l1 > l2 || (l1 == l2) && longword.compareTo(target) < 0) continue;
            if (isSubstr(s,target)) longword = target;
        }
        return longword;
    }
    
    private boolean isSubstr(String s, String target){
        int i=0, j = 0;
        while(i<s.length() && j<target.length()){
            if (s.charAt(i) == target.charAt(j)) j++;
            i++;
        }
        return j == target.length();
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值