Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2020-02-23 16:28:48 +08:00
parent f84b140418
commit 4994aea8bb
15 changed files with 1040 additions and 1056 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
docs/notes/Leetcode 题解 - 数组与矩阵.md
View File

@ -138,9 +138,7 @@ k = 8,
return 13. return 13.
``` ```
<EFBFBD><EFBFBD>题参考：[Share my thoughts and Clean Java Code 解题参考：[Share my thoughts and Clean Java Code](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
[Leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173) / [力扣](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
二分查找解法： 二分查找解法：
@ -233,15 +231,6 @@ private void swap(int[] nums, int i, int j) {
} }
``` ```
类似题目：
[448\. Find All Numbers Disappeared in an Array (Easy)
[Leetcode](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/)，寻找所有丢失的元<EFBFBD>) / [力扣](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/description/)，寻找所有丢失的元<EFBFBD>)
[442\. Find All Duplicates in an Array (Medium)
[Leetcode](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/)，寻找所有重复的元素<EFBFBD>) / [力扣](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/description/)，寻找所有重复的元素<EFBFBD>)
# 7. 找出数组中重复的数，数组值在 [1, n] 之间 # 7. 找出数组中重复的数，数组值在 [1, n] 之间
287\. Find the Duplicate Number (Medium) 287\. Find the Duplicate Number (Medium)

11
docs/notes/剑指 Offer 题解 - 目录.md
View File

@ -1,3 +1,10 @@
# 前言
题目来自《何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.》，刷题网站推荐：
- [牛客网](https://www.nowcoder.com/ta/coding-interviews?from=cyc_github)
- [Leetcode](https://leetcode-cn.com/problemset/lcof/)
# 目录 # 目录
@ -78,10 +85,6 @@
- [67. 把字符串转换成整数](67.%20把字符串转换成整数.md) - [67. 把字符串转换成整数](67.%20把字符串转换成整数.md)
- [68. 树中两个节点的最低公共祖先](68.%20树中两个节点的最低公共祖先.md) - [68. 树中两个节点的最低公共祖先](68.%20树中两个节点的最低公共祖先.md)
# 参考文献
何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.

13
notes/Leetcode 题解 - 数组与矩阵.md
View File

@ -138,9 +138,7 @@ k = 8,
return 13. return 13.
``` ```
<EFBFBD><EFBFBD>题参考：[Share my thoughts and Clean Java Code 解题参考：[Share my thoughts and Clean Java Code](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
[Leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173) / [力扣](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/85173)
二分查找解法： 二分查找解法：
@ -233,15 +231,6 @@ private void swap(int[] nums, int i, int j) {
} }
``` ```
类似题目：
[448\. Find All Numbers Disappeared in an Array (Easy)
[Leetcode](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/)，寻找所有丢失的元<EFBFBD>) / [力扣](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/description/)，寻找所有丢失的元<EFBFBD>)
[442\. Find All Duplicates in an Array (Medium)
[Leetcode](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/)，寻找所有重复的元素<EFBFBD>) / [力扣](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/description/)，寻找所有重复的元素<EFBFBD>)
# 7. 找出数组中重复的数，数组值在 [1, n] 之间 # 7. 找出数组中重复的数，数组值在 [1, n] 之间
287\. Find the Duplicate Number (Medium) 287\. Find the Duplicate Number (Medium)

11
notes/剑指 Offer 题解 - 目录.md
View File

@ -1,3 +1,10 @@
# 前言
题目来自《何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.》，刷题网站推荐：
- [牛客网](https://www.nowcoder.com/ta/coding-interviews?from=cyc_github)
- [Leetcode](https://leetcode-cn.com/problemset/lcof/)
# 目录 # 目录
@ -78,10 +85,6 @@
- [67. 把字符串转换成整数](67.%20把字符串转换成整数.md) - [67. 把字符串转换成整数](67.%20把字符串转换成整数.md)
- [68. 树中两个节点的最低公共祖先](68.%20树中两个节点的最低公共祖先.md) - [68. 树中两个节点的最低公共祖先](68.%20树中两个节点的最低公共祖先.md)
# 参考文献
何海涛. 剑指 Offer[M]. 电子工业出版社, 2012.