Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
wushizhenking
CS-Notes
提交
898bff37
C
CS-Notes
项目概览
wushizhenking
/
CS-Notes
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
CS-Notes
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
898bff37
编写于
10月 27, 2019
作者:
C
CyC2018
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
auto commit
上级
763b9194
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
14 addition
and
14 deletion
+14
-14
docs/notes/Leetcode 题解 - 双指针.md
docs/notes/Leetcode 题解 - 双指针.md
+7
-7
notes/Leetcode 题解 - 双指针.md
notes/Leetcode 题解 - 双指针.md
+7
-7
未找到文件。
docs/notes/Leetcode 题解 - 双指针.md
浏览文件 @
898bff37
...
...
@@ -15,7 +15,7 @@
167
\.
Two Sum II - Input array is sorted (Easy)
<a
href=
"https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/
)
```
html
Input: numbers={2, 7, 11, 15}, target=9
...
...
@@ -51,7 +51,7 @@ public int[] twoSum(int[] numbers, int target) {
633.
Sum of Square Numbers (Easy)
<a
href=
"https://leetcode.com/problems/sum-of-square-numbers/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/sum-of-square-numbers/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/sum-of-square-numbers/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/sum-of-square-numbers/description/
)
```
html
Input: 5
...
...
@@ -82,7 +82,7 @@ public boolean judgeSquareSum(int c) {
345.
Reverse Vowels of a String (Easy)
<a
href=
"https://leetcode.com/problems/reverse-vowels-of-a-string/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/reverse-vowels-of-a-string/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/
)
```
html
Given s = "leetcode", return "leotcede".
...
...
@@ -117,7 +117,7 @@ public String reverseVowels(String s) {
680.
Valid Palindrome II (Easy)
<a
href=
"https://leetcode.com/problems/valid-palindrome-ii/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/valid-palindrome-ii/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/valid-palindrome-ii/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/valid-palindrome-ii/description/
)
```
html
Input: "abca"
...
...
@@ -151,7 +151,7 @@ private boolean isPalindrome(String s, int i, int j) {
88.
Merge Sorted Array (Easy)
<a
href=
"https://leetcode.com/problems/merge-sorted-array/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/merge-sorted-array/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/merge-sorted-array/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/merge-sorted-array/description/
)
```
html
Input:
...
...
@@ -187,7 +187,7 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
141.
Linked List Cycle (Easy)
<a
href=
"https://leetcode.com/problems/linked-list-cycle/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/linked-list-cycle/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/linked-list-cycle/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/linked-list-cycle/description/
)
使用双指针,一个指针每次移动一个节点,一个指针每次移动两个节点,如果存在环,那么这两个指针一定会相遇。
...
...
@@ -212,7 +212,7 @@ public boolean hasCycle(ListNode head) {
524.
Longest Word in Dictionary through Deleting (Medium)
<a
href=
"https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/
)
```
Input:
...
...
notes/Leetcode 题解 - 双指针.md
浏览文件 @
898bff37
...
...
@@ -15,7 +15,7 @@
167
\.
Two Sum II - Input array is sorted (Easy)
<a
href=
"https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/
)
```
html
Input: numbers={2, 7, 11, 15}, target=9
...
...
@@ -51,7 +51,7 @@ public int[] twoSum(int[] numbers, int target) {
633.
Sum of Square Numbers (Easy)
<a
href=
"https://leetcode.com/problems/sum-of-square-numbers/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/sum-of-square-numbers/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/sum-of-square-numbers/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/sum-of-square-numbers/description/
)
```
html
Input: 5
...
...
@@ -82,7 +82,7 @@ public boolean judgeSquareSum(int c) {
345.
Reverse Vowels of a String (Easy)
<a
href=
"https://leetcode.com/problems/reverse-vowels-of-a-string/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/reverse-vowels-of-a-string/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/
)
```
html
Given s = "leetcode", return "leotcede".
...
...
@@ -117,7 +117,7 @@ public String reverseVowels(String s) {
680.
Valid Palindrome II (Easy)
<a
href=
"https://leetcode.com/problems/valid-palindrome-ii/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/valid-palindrome-ii/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/valid-palindrome-ii/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/valid-palindrome-ii/description/
)
```
html
Input: "abca"
...
...
@@ -151,7 +151,7 @@ private boolean isPalindrome(String s, int i, int j) {
88.
Merge Sorted Array (Easy)
<a
href=
"https://leetcode.com/problems/merge-sorted-array/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/merge-sorted-array/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/merge-sorted-array/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/merge-sorted-array/description/
)
```
html
Input:
...
...
@@ -187,7 +187,7 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
141.
Linked List Cycle (Easy)
<a
href=
"https://leetcode.com/problems/linked-list-cycle/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/linked-list-cycle/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/linked-list-cycle/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/linked-list-cycle/description/
)
使用双指针,一个指针每次移动一个节点,一个指针每次移动两个节点,如果存在环,那么这两个指针一定会相遇。
...
...
@@ -212,7 +212,7 @@ public boolean hasCycle(ListNode head) {
524.
Longest Word in Dictionary through Deleting (Medium)
<a
href=
"https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/"
target=
"_blank"
>
Leetcode
</a>
/
<a
href=
"https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/"
target=
"_blank"
>
力扣
</a>
[
Leetcode
](
https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/
)
/
[
力扣
](
https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/
)
```
Input:
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录