LeetCode 1408. String matching in arrays

1408. String matching in an array

[Violence] The amount of data is not large, so it is directly violent. Contains in java can be used to determine whether a string contains another string, but it should be noted that the final answer cannot contain repeated strings.

class Solution {// violence 3:20 1public List stringMatching(String[] words) {List ans = new ArrayList();int i, j, n = words.length;for (i = 0; i < n; i++) {for (j = 0; j < n; j++) {if (i != j && words[j].contains(words[i])) {ans.add(words[i]); break;}}}return ans;}}

class Solution {public:// violence 3:23 2vector stringMatching(vector& words) {int i, j, n= words.size();vector ans;for (i = 0; i < n; i++) {for (j = 0; j < n; j++) {if (i != j && words[j].find(words[i]) != -1) {ans.push_back(words[i]); break;}}}return ans;}};

[Hash + Split String] My own method, but slow

class Solution {// hash table 12:49public List stringMatching(String[] words) {Set set = new HashSet();for (var str: words) set.add(str);List ans = new ArrayList();for (var st: words) {String str = st;int n = str.length();for (var i = 0; i < n; i++) {for (var j = i + 1; j <= n; j++) {String tmp = str.substring(i, j);if (!tmp.equals(str) && set.contains(tmp)) {ans.add(tmp);set.remove(tmp);}}}}return ans;}}