摘要：
This problem can be solved by DP elegantly. You may refer to this link for the code and explanations.I try to rewrite the code, also in C++, but find ... 阅读全文
posted @ 2015-08-11 22:08
jianchao-li
阅读(201)
评论(0)
推荐(0)
摘要：
The idea is just to perform the addition from right to left as usual :-)Note that the result may be longer than the originaldigitsby1number (the carry... 阅读全文
posted @ 2015-08-11 09:43
jianchao-li
阅读(159)
评论(0)
推荐(0)
摘要：
The idea is just to add the elements in the spiral order. First the up-most row (u), then the right-most column (r), then the down-most row (d), and f... 阅读全文
posted @ 2015-08-11 08:51
jianchao-li
阅读(215)
评论(0)
推荐(0)
摘要：
The idea is just to generate the matrix in the spiral order. First the up-most row (u), then the right-most column (r), then the down-most row (d), an... 阅读全文
posted @ 2015-08-11 08:42
jianchao-li
阅读(171)
评论(0)
推荐(0)
浙公网安备 33010602011771号