# | Title | Editorial | Acceptance | Difficulty | Frequency | |
---|---|---|---|---|---|---|
。 | 65 | 12.6% | Hard | |||
。 | 126 | 13.6% | Hard | |||
。 | 149 | 15.6% | Hard | |||
。 | 146 | 16.0% | Hard | |||
。 | 68 | 18.1% | Hard | |||
。 | 460 | 19.0% | Hard | |||
。 | 44 | 19.0% | Hard | |||
。 | 308 | 19.8% | Hard | |||
。 | 4 | 20.8% | Hard | |||
。 | 420 | 21.0% | Hard | |||
。 | 273 | 21.1% | Hard | |||
。 | 30 | 21.7% | Hard | |||
。 | 440 | 22.1% | Hard | |||
。 | 140 | 22.2% | Hard | |||
。 | 212 | 22.2% | Hard | |||
。 | 269 | 22.3% | Hard | |||
。 | 174 | 22.9% | Hard | |||
。 | 214 | 23.0% | Hard | |||
。 | 446 | 23.0% | Hard | |||
。 | 32 | 23.1% | Hard | |||
。 | 295 | 23.3% | Hard | |||
。 | 132 | 23.4% | Hard | |||
。 | 10 | 23.6% | Hard | |||
。 | 76 | 23.8% | Hard | |||
。 | 188 | 23.8% | Hard | |||
。 | 321 | 23.9% | Hard | |||
。 | 135 | 23.9% | Hard | |||
。 | 335 | 23.9% | Hard | |||
。 | 97 | 23.9% | Hard | |||
。 | 391 | 24.2% | Hard | |||
。 | 158 | 24.4% | Hard | |||
。 | 466 | 24.6% | Hard | |||
。 | 336 | 24.7% | Hard | |||
。 | 41 | 24.9% | Hard | |||
。 | 124 | 25.0% | Hard | |||
224 | 25.5% | Hard | ||||
218 | 25.5% | Hard | ||||
84 | 25.6% | Hard | ||||
23 | 25.9% | Hard | ||||
45 | 26.0% | Hard | ||||
85 | 26.1% | Hard | ||||
57 | 26.3% | Hard | ||||
138 | 26.6% | Hard | ||||
233 | 27.3% | Hard | ||||
381 | 28.0% | Hard | ||||
37 | 28.1% | Hard | ||||
432 | 28.2% | Hard | ||||
87 | 28.3% | Hard | ||||
123 | 28.3% | Hard | ||||
56 | 28.4% | Hard | ||||
282 | 28.5% | Hard | ||||
316 | 28.6% | Hard | ||||
164 | 28.6% | Hard | ||||
99 | 28.7% | Hard | ||||
327 | 28.9% | Hard | ||||
51 | 29.0% | Hard | ||||
25 | 29.7% | Hard | ||||
472 | 30.1% | Hard | ||||
465 | 30.1% | Hard | ||||
248 | 30.5% | Hard | ||||
72 | 30.6% | Hard | ||||
115 | 30.6% | Hard | ||||
403 | 30.9% | Hard | ||||
411 | 31.1% | Hard | ||||
239 | 31.4% | Hard | ||||
330 | 31.5% | Hard | ||||
297 | 31.6% | Hard | ||||
354 | 31.8% | Hard | ||||
358 | 31.8% | Hard | ||||
33 | 31.9% | Hard | ||||
363 | 32.1% | Hard | ||||
410 | 32.2% | Hard | ||||
480 | 33.1% | Hard | ||||
317 | 33.3% | Hard | ||||
117 | 33.5% | Hard | ||||
315 | 33.5% | Hard | ||||
301 | 34.5% | Hard | ||||
42 | 35.3% | Hard | ||||
128 | 35.3% | Hard | ||||
329 | 35.4% | Hard | ||||
407 | 35.6% | Hard | ||||
154 | 36.2% | Hard | ||||
265 | 37.1% | Hard | ||||
272 | 37.6% | Hard | ||||
291 | 37.7% | Hard | ||||
305 | 38.1% | Hard | ||||
380 | 38.4% | Hard | ||||
145 | 38.4% | Hard | ||||
340 | 38.6% | Hard | ||||
352 | 38.9% | Hard | ||||
159 | 39.7% | Hard | ||||
312 | 41.6% | Hard | ||||
287 | 41.8% | Hard | ||||
425 | 41.9% | Hard | ||||
52 | 42.8% | Hard | ||||
302 | 44.0% | Hard | ||||
471 | 44.2% | Hard | ||||
296 | 50.4% | Hard |
336 | 24.7% | Hard |
https://discuss.leetcode.com/topic/40657/150-ms-45-lines-java-solution/2
这个解法非常的好,把每一个字符串放进hashmap。然后两个字符串拼成回文,其实就是可以把一个字符串x分成a+b,如果a是回文,那么如果b的逆能找到,标为c,那么结果c+a+b是回文,c和x就是能组成回文的一对;同样,如果b是回文,a的逆能找到,标为c,那么a+b+c是回文,那么x和c是能组成回文的一对。
是不是非常的棒!
41 | 24.9% | Hard |
这个看了解法,其实是循环放置数组,将对应的值放进对应的下标,再等处理完毕之后,从前到后看第一个缺失的是哪个位置的。
。 | 124 | 25.0% | Hard |
https://discuss.leetcode.com/topic/4407/accepted-short-solution-in-java
解法真好