diff options
Diffstat (limited to 'categories/学习笔记/index.xml')
| -rw-r--r-- | categories/学习笔记/index.xml | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/categories/学习笔记/index.xml b/categories/学习笔记/index.xml index 4af5387..b5be7f4 100644 --- a/categories/学习笔记/index.xml +++ b/categories/学习笔记/index.xml @@ -16,7 +16,7 @@ <pubDate>Thu, 26 Dec 2019 18:22:05 +0800</pubDate> <guid>https://xiaohei.im/hugo-theme-pure/2019/12/linkedlist/</guid> - <description>链表需要注意的问题: 边界: 头结点尾结点的处理,链表长度为1时的处理 多画图,跟一次循环,边界情况也画图试试 思路大多都是 快慢指针 No.19 =&gt; Remove Nth Node From End of</description> + <description></description> </item> <item> @@ -25,7 +25,7 @@ <pubDate>Thu, 26 Dec 2019 17:22:05 +0800</pubDate> <guid>https://xiaohei.im/hugo-theme-pure/2019/12/array/</guid> - <description>Easy =&gt; 1252. Cells with Odd Values in a Matrix public int oddCells(int n, int m, int[][] indices) { boolean[] oddRows = new boolean[n]; boolean[] oddCols = new boolean[m]; for(int[] item : indices) { // 遍历 indices 获取每一列每一行的出现次数是否为奇数 // 异或: 相同为0 不同为1 oddRows[item[0]] ^=</description> + <description></description> </item> <item> |