aboutsummaryrefslogtreecommitdiff
path: root/other/check_two_str_arr.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
committerJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
commita96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch)
treee2a2b3f49f9fb741be81415266ac93e74cff42ec /other/check_two_str_arr.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/check_two_str_arr.cpp')
-rw-r--r--other/check_two_str_arr.cpp26
1 files changed, 0 insertions, 26 deletions
diff --git a/other/check_two_str_arr.cpp b/other/check_two_str_arr.cpp
deleted file mode 100644
index 5e4d8a7..0000000
--- a/other/check_two_str_arr.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- bool arrayStringsAreEqual(vector<string> &word1, vector<string> &word2) {
- int i = 0, j = 0, m = 0, n = 0;
- while (i < word1.size() && j < word2.size()) {
- if (word1[i][m++] != word2[j][n++])
- return false;
- if (m >= word1[i].size())
- i++, m = 0;
- if (n >= word2[j].size())
- j++, n = 0;
- }
- return i == word1.size() && j == word2.size();
- }
-};
-
-int main() {
- Solution obj;
- vector<string> word1 = {"ab", "c"}, word2 = {"a", "bc"};
- if (obj.arrayStringsAreEqual(word1, word2))
- cout << "true";
- else
- cout << "false";
-}