![240](https://cdn2.jianshu.io/assets/default_avatar/1-04bbeead395d74921af6a4e8214b4f61.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
代码1 Runtime: 43 ms, faster than 11.05% of Java online submissions for Re...
代码1 dpAn example:S: [acdabefbc]T: [ab] first we check with a: then we ch...
代码1 Runtime: 3 ms, faster than 25.41% of Java online submissions for Dif...
代码1 Runtime: 9 ms, faster than 8.31% of Java online submissions for Long...
代码1 backtrackRuntime: 1 ms, faster than 84.99% of Java online submission...
代码1 DPRuntime: 9 ms, faster than 82.70% of Java online submissions for P...
代码1 DFSRuntime: 3 ms, faster than 59.03% of Java online submissions for ...
代码1 首先把每个单词都放进去这个逆向单词树。然后试着是否能不停的往下走。有两种情况是可以认为当前遍历的词和某个节点可以形成一个结果配对的。如果...
代码1 第一次自己做出hard题Runtime: 118 ms, faster than 42.09% of Java online submi...