test: 966 solution

py, c++, go, java

Author: QuBenhao

data/ratings.json

@@ -1,29 +1,77 @@
 //go:build ignore
 #include "cpp/common/Solution.h"
-
+#include <algorithm>
 
 using namespace std;
 using json = nlohmann::json;
 
+constexpr string VOWELS = "aeiou";
+
 class Solution {
 public:
-    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
-        
+  vector<string> spellchecker(const vector<string> &wordlist,
+                              const vector<string> &queries) {
+    unordered_set<string> origin;
+    unordered_map<string, string> ignore_cases, ignore_vowels;
+
+    auto strIgnoreVowels = [](string &w) -> void {
+      for (auto &c : w) {
+        if (VOWELS.find(c) != string::npos) {
+          c = '*';
+        }
+      }
+    };
+
+    for (const auto &word : wordlist) {
+      origin.insert(word);
+      string lower = word;
+      std::transform(word.begin(), word.end(), lower.begin(), ::tolower);
+      if (ignore_cases.find(lower) == ignore_cases.end()) {
+        ignore_cases[lower] = word;
+      }
+      strIgnoreVowels(lower);
+      if (ignore_vowels.find(lower) == ignore_vowels.end()) {
+        ignore_vowels[lower] = word;
+      }
     }
+
+    vector<string> ans;
+    for (const auto &query : queries) {
+      if (origin.contains(query)) {
+        ans.emplace_back(query);
+        continue;
+      }
+      string lower = query;
+      std::transform(query.begin(), query.end(), lower.begin(), ::tolower);
+      auto it = ignore_cases.find(lower);
+      if (it != ignore_cases.end()) {
+        ans.emplace_back(it->second);
+        continue;
+      }
+      strIgnoreVowels(lower);
+      it = ignore_vowels.find(lower);
+      if (it != ignore_vowels.end()) {
+        ans.emplace_back(it->second);
+        continue;
+      }
+      ans.emplace_back("");
+    }
+    return ans;
+  }
 };
 
 json leetcode::qubh::Solve(string input_json_values) {
-	vector<string> inputArray;
-	size_t pos = input_json_values.find('\n');
-	while (pos != string::npos) {
-		inputArray.push_back(input_json_values.substr(0, pos));
-		input_json_values = input_json_values.substr(pos + 1);
-		pos = input_json_values.find('\n');
-	}
-	inputArray.push_back(input_json_values);
-
-	Solution solution;
-	vector<string> wordlist = json::parse(inputArray.at(0));
-	vector<string> queries = json::parse(inputArray.at(1));
-	return solution.spellchecker(wordlist, queries);
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
+
+  Solution solution;
+  vector<string> wordlist = json::parse(inputArray.at(0));
+  vector<string> queries = json::parse(inputArray.at(1));
+  return solution.spellchecker(wordlist, queries);
 }

problems/problems_966/Solution.cpp

@@ -7,7 +7,42 @@
 
 public class Solution extends BaseSolution {
     public String[] spellchecker(String[] wordlist, String[] queries) {
-        
+        int n = wordlist.length;
+        Set<String> origin = new HashSet<>(Arrays.asList(wordlist));
+        Map<String, String> lowerToOrigin = new HashMap<>(n); // 预分配空间
+        Map<String, String> vowelToOrigin = new HashMap<>(n);
+
+        for (int i = n - 1; i >= 0; i--) {
+            String s = wordlist[i];
+            String lower = s.toLowerCase();
+            lowerToOrigin.put(lower, s); // 例如 kite -> KiTe
+            vowelToOrigin.put(replaceVowels(lower), s); // 例如 k?t? -> KiTe
+        }
+
+        for (int i = 0; i < queries.length; i++) {
+            String q = queries[i];
+            if (origin.contains(q)) { // 完全匹配
+                continue;
+            }
+            String lower = q.toLowerCase();
+            if (lowerToOrigin.containsKey(lower)) { // 不区分大小写的匹配
+                queries[i] = lowerToOrigin.get(lower);
+            } else { // 不区分大小写+元音模糊匹配
+                queries[i] = vowelToOrigin.getOrDefault(replaceVowels(lower), "");
+            }
+        }
+        return queries;
+    }
+
+    private String replaceVowels(String str) {
+        char[] s = str.toCharArray();
+        for (int i = 0; i < s.length; ++i) {
+            char c = s[i];
+            if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
+                s[i] = '?';
+            }
+        }
+        return new String(s);
     }
 
     @Override

problems/problems_966/Solution.java

@@ -3,11 +3,38 @@ package problem966
 import (
 	"encoding/json"
 	"log"
+	"slices"
 	"strings"
 )
 
-func spellchecker(wordlist []string, queries []string) []string {
-    
+func spellchecker(wordlist, queries []string) []string {
+	n := len(wordlist)
+	origin := make(map[string]bool, n) // 预分配空间
+	lowerToOrigin := make(map[string]string, n)
+	vowelToOrigin := make(map[string]string, n)
+	// 把元音都替换成 '?'
+	vowelReplacer := strings.NewReplacer("a", "?", "e", "?", "i", "?", "o", "?", "u", "?")
+
+	for _, s := range slices.Backward(wordlist) {
+		origin[s] = true
+		lower := strings.ToLower(s)
+		lowerToOrigin[lower] = s                        // 例如 kite -> KiTe
+		vowelToOrigin[vowelReplacer.Replace(lower)] = s // 例如 k?t? -> KiTe
+	}
+
+	for i, q := range queries {
+		if origin[q] { // 完全匹配
+			continue
+		}
+		lower := strings.ToLower(q)
+		if s, ok := lowerToOrigin[lower]; ok { // 不区分大小写的匹配
+			queries[i] = s
+		} else { // 不区分大小写+元音模糊匹配
+			queries[i] = vowelToOrigin[vowelReplacer.Replace(lower)]
+		}
+	}
+
+	return queries
 }
 
 func Solve(inputJsonValues string) any {

problems/problems_966/solution.go

@@ -7,5 +7,38 @@ def solve(self, test_input=None):
         return self.spellchecker(*test_input)
 
     def spellchecker(self, wordlist: List[str], queries: List[str]) -> List[str]:
-        pass
+        origin = set()
+        ignore_cases = dict()
+        ignore_vowels = dict()
 
+        def str_to_ignore_vowels(w: str) -> str:
+            w = w.lower()
+            res = []
+            for c in w:
+                if c in VOWELS:
+                    res.append('*')
+                else:
+                    res.append(c)
+            return "".join(res)
+
+        for word in wordlist:
+            origin.add(word)
+            if (l := word.lower()) not in ignore_cases:
+                ignore_cases[l] = word
+            if (l := str_to_ignore_vowels(word)) not in ignore_vowels:
+                ignore_vowels[l] = word
+        ans = []
+        for query in queries:
+            if query in origin:
+                ans.append(query)
+                continue
+            if (l := query.lower()) in ignore_cases:
+                ans.append(ignore_cases[l])
+                continue
+            if (l := str_to_ignore_vowels(query)) in ignore_vowels:
+                ans.append(ignore_vowels[l])
+                continue
+            ans.append("")
+        return ans
+
+VOWELS = "aeiouAEIOU"

problems/problems_966/solution.py

@@ -1,2 +1,2 @@
-["[\"KiTe\",\"kite\",\"hare\",\"Hare\"]\n[\"kite\",\"Kite\",\"KiTe\",\"Hare\",\"HARE\",\"Hear\",\"hear\",\"keti\",\"keet\",\"keto\"]", "[\"yellow\"]\n[\"YellOw\"]"]
-[["kite", "KiTe", "KiTe", "Hare", "hare", "", "", "KiTe", "", "KiTe"], ["yellow"]]
+["[\"KiTe\",\"kite\",\"hare\",\"Hare\"]\n[\"kite\",\"Kite\",\"KiTe\",\"Hare\",\"HARE\",\"Hear\",\"hear\",\"keti\",\"keet\",\"keto\"]", "[\"yellow\"]\n[\"YellOw\"]", "[\"ae\",\"aa\"]\n[\"UU\"]"]
+[["kite", "KiTe", "KiTe", "Hare", "hare", "", "", "KiTe", "", "KiTe"], ["yellow"], ["ae"]]

problems/problems_966/testcase

@@ -9,6 +9,7 @@ def __init__(self):
 		self.testcases = []
 		self.testcases.append(case(Input=[['KiTe', 'kite', 'hare', 'Hare'], ['kite', 'Kite', 'KiTe', 'Hare', 'HARE', 'Hear', 'hear', 'keti', 'keet', 'keto']], Output=['kite', 'KiTe', 'KiTe', 'Hare', 'hare', '', '', 'KiTe', '', 'KiTe']))
 		self.testcases.append(case(Input=[['yellow'], ['YellOw']], Output=['yellow']))
+		self.testcases.append(case(Input=[["ae","aa"],["UU"]], Output=["ae"]))
 
 	def get_testcases(self):
 		return self.testcases

problems/problems_966/testcase.py

@@ -25,3 +25,28 @@ func singleNumber(nums []int) int {
     return ans
 }
 ```
+
+## 线性基求最大异或子集
+
+```python
+def find_maximum_xor(arr):
+    if not arr:
+        return 0
+    base = [0] * 32
+    
+    for x in arr:
+        for i in range(31, -1, -1):
+            if (x >> i) & 1:
+                if base[i]:
+                    x ^= base[i]
+                else:
+                    base[i] = x
+                    break
+    
+    res = 0
+    for i in range(31, -1, -1):
+        if base[i] != 0 and (res >> i) & 1 == 0:
+            res ^= base[i]
+            
+    return res
+```