From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/verify_alien_dict.cpp | 42 ------------------------------------------ 1 file changed, 42 deletions(-) delete mode 100644 other/verify_alien_dict.cpp (limited to 'other/verify_alien_dict.cpp') diff --git a/other/verify_alien_dict.cpp b/other/verify_alien_dict.cpp deleted file mode 100644 index 009ac52..0000000 --- a/other/verify_alien_dict.cpp +++ /dev/null @@ -1,42 +0,0 @@ -// 953. Verifying an Alien Dictionary -#include "leetcode.h" - -/* - * in an alien language, they also use english lowercase letters but in - * different 'order'. the 'order' of the alphabet is some permutation of - * lowercase letters. given a sequence of 'words' written in the alien language, - * and the 'order' of the alphabet, return 1 if and only if the given 'words' - * are sorted lexicographically in this alien language. - */ - -class Solution { -public: - bool isAlienSorted(vector &words, string order) { - size_t indices[26]{}; - for (size_t i = 0; i < order.size(); ++i) - indices[order[i] - 'a'] = i; - return is_sorted(words.begin(), words.end(), - [&indices](const string &w1, const string &w2) { - auto l1 = w1.size(), l2 = w2.size(); - for (auto i = 0; i < min(l1, l2); ++i) { - auto c1 = w1[i], c2 = w2[i]; - if (c1 != c2) - return indices[c1 - 'a'] < indices[c2 - 'a']; - } - return l1 < l2; - }); - } -}; - -int main() { - Solution obj; - vector words1 = {"hello", "leetcode"}; - vector words2 = {"word", "world", "row"}; - vector words3 = {"apple", "app"}; - cout << obj.isAlienSorted(words1, "hlabcdefgijkmnopqrstuvwxyz") - << endl; // expect: 1 - cout << obj.isAlienSorted(words2, "worldabcefghijkmnpqstuvxyz") - << endl; // expect: 0 - cout << obj.isAlienSorted(words3, "abcdefghijklmnopqrstuvwxyz") - << endl; // expect: 0 -} -- cgit v1.2.3