git

Author: walkccc

solutions/3556. Sum of Largest Prime Substrings/3556.cpp

@@ -7,7 +7,7 @@ class Solution {
     for (int i = 0; i < n; ++i)
       for (int j = i + 1; j <= n; ++j) {
         const long num = stol(s.substr(i, j - i));
-        if (primes.count(num) == 0 && isPrime(num))
+        if (!primes.contains(num) && isPrime(num))
           primes.insert(num);
       }
 

solutions/3557. Find Maximum Number of Non Intersecting Substrings/3557.cpp

@@ -0,0 +1,19 @@
+class Solution {
+ public:
+  int maxSubstrings(string word) {
+    int ans = 0;
+    unordered_map<char, int> firstSeen;
+
+    for (int i = 0; i < word.length(); ++i) {
+      const char c = word[i];
+      if (!firstSeen.contains(c)) {
+        firstSeen[c] = i;
+      } else if (i - firstSeen[c] + 1 >= 4) {
+        ++ans;
+        firstSeen.clear();
+      }
+    }
+
+    return ans;
+  }
+};

solutions/3557. Find Maximum Number of Non Intersecting Substrings/3557.java

@@ -0,0 +1,18 @@
+class Solution {
+  public int maxSubstrings(String word) {
+    int ans = 0;
+    Map<Character, Integer> firstSeen = new HashMap<>();
+
+    for (int i = 0; i < word.length(); ++i) {
+      final char c = word.charAt(i);
+      if (!firstSeen.containsKey(c)) {
+        firstSeen.put(c, i);
+      } else if (i - firstSeen.get(c) + 1 >= 4) {
+        ++ans;
+        firstSeen.clear();
+      }
+    }
+
+    return ans;
+  }
+}

solutions/3557. Find Maximum Number of Non Intersecting Substrings/3557.py

@@ -0,0 +1,13 @@
+class Solution:
+  def maxSubstrings(self, word: str) -> int:
+    ans = 0
+    firstSeen = {}
+
+    for i, c in enumerate(word):
+      if c not in firstSeen:
+        firstSeen[c] = i
+      elif i - firstSeen[c] + 1 >= 4:
+        ans += 1
+        firstSeen.clear()
+
+    return ans