ElseWhereR的博客

and step 14 matrix[1][1]=0 → 触发处理, then the matrix turn to。What is 原地算法, which is In-plcae Algorithm？

*************C++topic： 54. 螺旋矩阵 - 力扣（LeetCode）*************Look at the problem first.Matrix is composed of n lines and n columns. Yesterday I learned how to creat one-dimension vector and two-dimension vector. And I am going to relearn again.create two-

C++数组 - 八皇后 - 困难-优快云博客。

转换成小写字母 - 简单-优快云博客。

【代码】单调数列 - 简单。

【代码】判断能否形成等差数列 - 简单。

s[3], 那么ab就不是那个能组成字符串的，就得重新回到开始的地方，abac可能是最小单元字符串。的长度，注意前缀不包含最后一个字符，后缀不包含第一个字符。前缀：开头必须是s[i];后缀：结尾必须是s[i];

文章浏览阅读82次。【代码】移动0 - 简单。移动0 - 简单-优快云博客。

【代码】买卖股票的最佳时机 IV - 困难。

the next step is 遍历选择列表. This is the most diffcult step, including how to lay the queens. Make sure that every column has been visited.and what is 处理解决方案？move next, what is 满足结束条件?