谁来带头BSO?# Stock
M*a
1 楼
Given an 2D array of characters. Find words in the array (either vertical or
horizontal). a character cannot be part of 2 words. Maximize the number of
characters used. Hint: 1D variant can be solved by Dynamic programming in
linear time.
onsite都做不出来
出这题的人脑子进水了
horizontal). a character cannot be part of 2 words. Maximize the number of
characters used. Hint: 1D variant can be solved by Dynamic programming in
linear time.
onsite都做不出来
出这题的人脑子进水了