ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
the code give time limit excceded when I try it now in augus 14 2022
getting TLE now
nice one , smart and clear, it takes me a little time to figure out why BFS miss some result, and I tried to use BFS + DFS backtrack, but actually just use your idea will work
It should be n^2 because each iteration, curList+[nextWord] is O(n)
They definilty added more test cases, I'm getting a MLE at 32/36 testcases
Hi Cheng, are u not actively solving leetcode these days??
yea, bit busy with my job
@@happycoding1093 where are you working currently?
Your curList contains all the words used for the path, you only need to check if nextword is in your curList or not.
00:16 to the N word
the code give time limit excceded when I try it now in augus 14 2022
getting TLE now
nice one , smart and clear, it takes me a little time to figure out why BFS miss some result, and I tried to use BFS + DFS backtrack, but actually just use your idea will work
It should be n^2 because each iteration, curList+[nextWord] is O(n)
They definilty added more test cases, I'm getting a MLE at 32/36 testcases
Hi Cheng, are u not actively solving leetcode these days??
yea, bit busy with my job
@@happycoding1093 where are you working currently?
Your curList contains all the words used for the path, you only need to check if nextword is in your curList or not.
00:16 to the N word