LeetCode 524. Longest Word in Dictionary through Deleting

问题描述

https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/

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.

问题分析

给定一个字符串和一个字符串数组，找出字符串数组中长度最长的哪个。如果长度相同，就返回asc排序小的哪个。如果为空，返回空字符串。

代码实现

 /**
     * 给定字符串s，和字符串序列，从d中找出一个字符串，其中支付串是s的子串。如果存在多个，就返回值最小的哪个，如果没有就返回空。
     *
     * @param s
     * @param d
     * @return
     */
    public String findLongestWord(String s, List<String> d) {


        if (s == null || s.length() == 0 || d == null || d.isEmpty()) {
            return "";
        }
        String longestWord = "";
        for (String word : d) {
            if (isSubString(s, word)) {
                if (longestWord.length() < word.length() || (longestWord.length() == word.length() && word.compareTo(longestWord) < 0)) {
                    longestWord = word;
                }
            }
        }
        return longestWord;
    }

    /**
     * 判断 word 是否是s的子串
     * 使用两个游标分别指向word和s。
     * 当两个值相等的时候，游标向前移动，如果不相等时  s的游标向前。
     * 如果word的游标走到最后，是需要的值。
     * 如果s的游标最后。但是  word的游标没有走到最后，就返回false。
     *
     * @param s
     * @param word
     * @return
     */
    private boolean isSubString(String s, String word) {

        if (word.length() > s.length()) {
            return false;
        }
        int indexS = 0;
        int indexWord = 0;
        while (indexS < s.length() && indexWord < word.length()) {
            if (s.charAt(indexS) == word.charAt(indexWord)) {
                indexWord++;
            }
            indexS++;
        }
        return indexWord == word.length();
    }