Skip to content

Commit 24f3a80

Browse files
yanglbmeyanglbme
committedJul 13, 2022
feat: add solutions to lc problem: No.1065
No.1065.Index Pairs of a String
1 parent bf21f11 commit 24f3a80

File tree

6 files changed

+510
-0
lines changed

6 files changed

+510
-0
lines changed
 

‎solution/1000-1099/1065.Index Pairs of a String/README.md

+178
Original file line numberDiff line numberDiff line change
@@ -41,22 +41,200 @@
4141

4242
<!-- 这里可写通用的实现逻辑 -->
4343

44+
**方法一：暴力枚举**
45+
46+
**方法二：前缀树**
47+
4448
<!-- tabs:start -->
4549

4650
### **Python3**
4751

4852
<!-- 这里可写当前语言的特殊实现逻辑 -->
4953

5054
```python
55+
class Solution:
56+
def indexPairs(self, text: str, words: List[str]) -> List[List[int]]:
57+
words = set(words)
58+
n = len(text)
59+
return [[i, j] for i in range(n) for j in range(i, n) if text[i: j + 1] in words]
60+
```
5161

62+
```python
63+
class Trie:
64+
def __init__(self):
65+
self.children = [None] * 26
66+
self.is_end = False
67+
68+
def insert(self, word):
69+
node = self
70+
for c in word:
71+
idx = ord(c) - ord('a')
72+
if node.children[idx] is None:
73+
node.children[idx] = Trie()
74+
node = node.children[idx]
75+
node.is_end = True
76+
77+
78+
class Solution:
79+
def indexPairs(self, text: str, words: List[str]) -> List[List[int]]:
80+
trie = Trie()
81+
for w in words:
82+
trie.insert(w)
83+
n = len(text)
84+
ans = []
85+
for i in range(n):
86+
node = trie
87+
for j in range(i, n):
88+
idx = ord(text[j]) - ord('a')
89+
if node.children[idx] is None:
90+
break
91+
node = node.children[idx]
92+
if node.is_end:
93+
ans.append([i, j])
94+
return ans
5295
```
5396

5497
### **Java**
5598

5699
<!-- 这里可写当前语言的特殊实现逻辑 -->
57100

58101
```java
102+
class Trie {
103+
Trie[] children = new Trie[26];
104+
boolean isEnd = false;
105+
106+
void insert(String word) {
107+
Trie node = this;
108+
for (char c : word.toCharArray()) {
109+
c -= 'a';
110+
if (node.children[c] == null) {
111+
node.children[c] = new Trie();
112+
}
113+
node = node.children[c];
114+
}
115+
node.isEnd = true;
116+
}
117+
}
118+
119+
class Solution {
120+
public int[][] indexPairs(String text, String[] words) {
121+
Trie trie = new Trie();
122+
for (String w : words) {
123+
trie.insert(w);
124+
}
125+
int n = text.length();
126+
List<int[]> ans = new ArrayList<>();
127+
for (int i = 0; i < n; ++i) {
128+
Trie node = trie;
129+
for (int j = i; j < n; ++j) {
130+
int idx = text.charAt(j) - 'a';
131+
if (node.children[idx] == null) {
132+
break;
133+
}
134+
node = node.children[idx];
135+
if (node.isEnd) {
136+
ans.add(new int[]{i, j});
137+
}
138+
}
139+
}
140+
return ans.toArray(new int[ans.size()][2]);
141+
}
142+
}
143+
```
144+
145+
### **C++**
146+
147+
```cpp
148+
class Trie {
149+
public:
150+
vector<Trie*> children;
151+
bool isEnd = false;
152+
153+
Trie() {
154+
children.resize(26);
155+
}
156+
157+
void insert(string word) {
158+
Trie* node = this;
159+
for (char c : word)
160+
{
161+
c -= 'a';
162+
if (!node->children[c]) node->children[c] = new Trie();
163+
node = node->children[c];
164+
}
165+
node->isEnd = true;
166+
}
167+
};
168+
169+
class Solution {
170+
public:
171+
vector<vector<int>> indexPairs(string text, vector<string>& words) {
172+
Trie* trie = new Trie();
173+
for (auto w : words) trie->insert(w);
174+
int n = text.size();
175+
vector<vector<int>> ans;
176+
for (int i = 0; i < n; ++i)
177+
{
178+
Trie* node = trie;
179+
for (int j = i; j < n; ++j)
180+
{
181+
int idx = text[j] - 'a';
182+
if (!node->children[idx]) break;
183+
node = node->children[idx];
184+
if (node->isEnd) ans.push_back({i, j});
185+
}
186+
}
187+
return ans;
188+
}
189+
};
190+
```
59191
192+
### **Go**
193+
194+
```go
195+
type Trie struct {
196+
children [26]*Trie
197+
isEnd bool
198+
}
199+
200+
func newTrie() *Trie {
201+
return &Trie{}
202+
}
203+
204+
func (this *Trie) insert(word string) {
205+
node := this
206+
for _, c := range word {
207+
idx := int(c - 'a')
208+
if node.children[idx] == nil {
209+
node.children[idx] = newTrie()
210+
}
211+
node = node.children[idx]
212+
}
213+
node.isEnd = true
214+
}
215+
216+
func indexPairs(text string, words []string) [][]int {
217+
trie := newTrie()
218+
for _, w := range words {
219+
trie.insert(w)
220+
}
221+
n := len(text)
222+
var ans [][]int
223+
for i := range text {
224+
node := trie
225+
for j := i; j < n; j++ {
226+
idx := int(text[j] - 'a')
227+
if node.children[idx] == nil {
228+
break
229+
}
230+
node = node.children[idx]
231+
if node.isEnd {
232+
ans = append(ans, []int{i, j})
233+
}
234+
}
235+
}
236+
return ans
237+
}
60238
```
61239

62240
### **...**

‎solution/1000-1099/1065.Index Pairs of a String/README_EN.md

+174
Original file line numberDiff line numberDiff line change
@@ -42,13 +42,187 @@
4242
### **Python3**
4343

4444
```python
45+
class Solution:
46+
def indexPairs(self, text: str, words: List[str]) -> List[List[int]]:
47+
words = set(words)
48+
n = len(text)
49+
return [[i, j] for i in range(n) for j in range(i, n) if text[i: j + 1] in words]
50+
```
4551

52+
```python
53+
class Trie:
54+
def __init__(self):
55+
self.children = [None] * 26
56+
self.is_end = False
57+
58+
def insert(self, word):
59+
node = self
60+
for c in word:
61+
idx = ord(c) - ord('a')
62+
if node.children[idx] is None:
63+
node.children[idx] = Trie()
64+
node = node.children[idx]
65+
node.is_end = True
66+
67+
68+
class Solution:
69+
def indexPairs(self, text: str, words: List[str]) -> List[List[int]]:
70+
trie = Trie()
71+
for w in words:
72+
trie.insert(w)
73+
n = len(text)
74+
ans = []
75+
for i in range(n):
76+
node = trie
77+
for j in range(i, n):
78+
idx = ord(text[j]) - ord('a')
79+
if node.children[idx] is None:
80+
break
81+
node = node.children[idx]
82+
if node.is_end:
83+
ans.append([i, j])
84+
return ans
4685
```
4786

4887
### **Java**
4988

5089
```java
90+
class Trie {
91+
Trie[] children = new Trie[26];
92+
boolean isEnd = false;
93+
94+
void insert(String word) {
95+
Trie node = this;
96+
for (char c : word.toCharArray()) {
97+
c -= 'a';
98+
if (node.children[c] == null) {
99+
node.children[c] = new Trie();
100+
}
101+
node = node.children[c];
102+
}
103+
node.isEnd = true;
104+
}
105+
}
106+
107+
class Solution {
108+
public int[][] indexPairs(String text, String[] words) {
109+
Trie trie = new Trie();
110+
for (String w : words) {
111+
trie.insert(w);
112+
}
113+
int n = text.length();
114+
List<int[]> ans = new ArrayList<>();
115+
for (int i = 0; i < n; ++i) {
116+
Trie node = trie;
117+
for (int j = i; j < n; ++j) {
118+
int idx = text.charAt(j) - 'a';
119+
if (node.children[idx] == null) {
120+
break;
121+
}
122+
node = node.children[idx];
123+
if (node.isEnd) {
124+
ans.add(new int[]{i, j});
125+
}
126+
}
127+
}
128+
return ans.toArray(new int[ans.size()][2]);
129+
}
130+
}
131+
```
132+
133+
### **C++**
134+
135+
```cpp
136+
class Trie {
137+
public:
138+
vector<Trie*> children;
139+
bool isEnd = false;
140+
141+
Trie() {
142+
children.resize(26);
143+
}
144+
145+
void insert(string word) {
146+
Trie* node = this;
147+
for (char c : word)
148+
{
149+
c -= 'a';
150+
if (!node->children[c]) node->children[c] = new Trie();
151+
node = node->children[c];
152+
}
153+
node->isEnd = true;
154+
}
155+
};
156+
157+
class Solution {
158+
public:
159+
vector<vector<int>> indexPairs(string text, vector<string>& words) {
160+
Trie* trie = new Trie();
161+
for (auto w : words) trie->insert(w);
162+
int n = text.size();
163+
vector<vector<int>> ans;
164+
for (int i = 0; i < n; ++i)
165+
{
166+
Trie* node = trie;
167+
for (int j = i; j < n; ++j)
168+
{
169+
int idx = text[j] - 'a';
170+
if (!node->children[idx]) break;
171+
node = node->children[idx];
172+
if (node->isEnd) ans.push_back({i, j});
173+
}
174+
}
175+
return ans;
176+
}
177+
};
178+
```
51179
180+
### **Go**
181+
182+
```go
183+
type Trie struct {
184+
children [26]*Trie
185+
isEnd bool
186+
}
187+
188+
func newTrie() *Trie {
189+
return &Trie{}
190+
}
191+
192+
func (this *Trie) insert(word string) {
193+
node := this
194+
for _, c := range word {
195+
idx := int(c - 'a')
196+
if node.children[idx] == nil {
197+
node.children[idx] = newTrie()
198+
}
199+
node = node.children[idx]
200+
}
201+
node.isEnd = true
202+
}
203+
204+
func indexPairs(text string, words []string) [][]int {
205+
trie := newTrie()
206+
for _, w := range words {
207+
trie.insert(w)
208+
}
209+
n := len(text)
210+
var ans [][]int
211+
for i := range text {
212+
node := trie
213+
for j := i; j < n; j++ {
214+
idx := int(text[j] - 'a')
215+
if node.children[idx] == nil {
216+
break
217+
}
218+
node = node.children[idx]
219+
if node.isEnd {
220+
ans = append(ans, []int{i, j})
221+
}
222+
}
223+
}
224+
return ans
225+
}
52226
```
53227

54228
### **...**

0 commit comments

Comments
 (0)