CS-Notes

CS-Notes copied to clipboard

数组中重复的数字，去掉一行没有意义的swap

1

感觉第39行的 swap没有存在的意义，因为执行到此处说明 i == nums[i]，那么同一个位置交换前和交换后是没有什么变化的(swap(nums, n, n))

liyongjun1

XSun771

原型模式更改建议

haiyang679

can add list

6

可以添加链表找环、双向链表等等经典题型。

jujimeizuo

发现一点小错误

3

[原题链接](https://github.com/CyC2018/CS-Notes/blob/master/notes/Leetcode%20%E9%A2%98%E8%A7%A3%20-%20%E5%8F%8C%E6%8C%87%E9%92%88.md#2-%E4%B8%A4%E6%95%B0%E5%B9%B3%E6%96%B9%E5%92%8C) ~~~c++ class Solution { public: bool judgeSquareSum(int c) { if(c

hello-ikun

OS

13

磁盘阵列

zynowhere

如题

just-automatic

修改 .gitattributes

1

修改后GitHub可以正确的将Repo语言识别为Markdown 

Mehver

It should go with reverse inorder traversal to find Kth largest node. Thus, the steps in solution should be reversed as below: inOrder(root.right, k); inOrder(root.left, k); https://github.com/CyC2018/CS-Notes/blob/master/notes/54.%20%E4%BA%8C%E5%8F%89%E6%9F%A5%E6%89%BE%E6%A0%91%E7%9A%84%E7%AC%AC%20K%20%E4%B8%AA%E7%BB%93%E7%82%B9.md

Miaooocat

I don't speak chinese, but it's good

SCP07Craft