diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/longest_word_dict.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/longest_word_dict.cpp')
-rw-r--r-- | other/longest_word_dict.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/longest_word_dict.cpp b/other/longest_word_dict.cpp deleted file mode 100644 index 3be4538..0000000 --- a/other/longest_word_dict.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - string findLongestWord(string s, vector<string> &dictionary) { - string ans; - for (auto d : dictionary) - if (canForm(d, s)) - if (d.size() > ans.size() || (d.size() == ans.size() && d < ans)) - ans = d; - return ans; - } - -private: - bool canForm(string w, string s) { - int w1 = 0, s1 = 0; - while (w1 < w.size() && s1 < s.size()) { - if (w[w1] == s[s1]) - w1++; - s1++; - } - return w1 == w.size(); - } -}; - -int main() { - Solution obj; - string s = "abpcplea"; - vector<string> dictionary = {"ale", "apple", "monkey", "plea"}; - cout << obj.findLongestWord(s, dictionary); -} |