給你一個字符串?s?和一個字符串?dāng)?shù)組?dictionary?，找出并返回?dictionary?中最長的字符串，該字符串可以通過刪除?s?中的某些字符得到。

如果答案不止一個，返回長度最長且字母序最小的字符串。如果答案不存在，則返回空字符串。

示例 1：

輸入：s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]
輸出："apple"

示例 2：

輸入：s = "abpcplea", dictionary = ["a","b","c"]
輸出："a"

/*** @param {string} s* @param {string[]} dictionary* @return {string}*/
var findLongestWord = function(s, dictionary) {let max = 0,str = ''for(let i = 0;i<dictionary.length;i++){let left = 0,right =0while(left<s.length&&right<dictionary[i].length){if(s[left]==dictionary[i][right]){left++right++}else{left++}}if(right>=dictionary[i].length){if(max<dictionary[i].length||max==dictionary[i].length&&dictionary[i]<str){max = dictionary[i].lengthstr = dictionary[i]}}}return str
};