LeetCode知识点总结 - 524

LeetCode 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.

思路

Check every word dictWord in the dictionary:
Check 1: dictWord is a subsequence of s
Check 2: only consider words that are LONGER or SAME LENGTH as current longest
Two cases to update answer:
1… New word is LONGER than old longest, OR
2. Same length BUT lex order is SMALLER (e.g., “apple” < “apply”)

答案

classSolution{publicintfib(intN){if(N<=1)returnN;inta=0,b=1;while(N-->1){intsum=a+b;a=b;b=sum;}returnb;}}