Skip to content

Commit df2d452

Browse files
yanglbmeyanglbme
committed
fix: update README.md
1 parent 678337b commit df2d452

File tree

110 files changed

+1349
-799
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

110 files changed

+1349
-799
lines changed

‎lcci/01.01.Is Unique/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.01. Is Unique](https://leetcode-cn.com/problems/is-unique-lcci)
22

3+
[中文文档](/lcci/01.01.Is%20Unique/README.md)
4+
35
## Description
46
<p>Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?</p>
57

‎lcci/01.02.Check Permutation/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.02. Check Permutation](https://leetcode-cn.com/problems/check-permutation-lcci)
22

3+
[中文文档](/lcci/01.02.Check%20Permutation/README.md)
4+
35
## Description
46
<p>Given two strings,write a method to decide if one is a permutation of the other.</p>
57

‎lcci/01.03.String to URL/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.03. String to URL](https://leetcode-cn.com/problems/string-to-url-lcci)
22

3+
[中文文档](/lcci/01.03.String%20to%20URL/README.md)
4+
35
## Description
46
<p>Write a method to replace all spaces in a string with &#39;%20&#39;. You may assume that the string has sufficient space at the end to hold the additional characters,and that you are given the &quot;true&quot; length of the string. (Note: If implementing in Java,please use a character array so that you can perform this operation in place.)</p>
57

‎lcci/01.04.Palindrome Permutation/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.04. Palindrome Permutation](https://leetcode-cn.com/problems/palindrome-permutation-lcci)
22

3+
[中文文档](/lcci/01.04.Palindrome%20Permutation/README.md)
4+
35
## Description
46
<p>Given a string, write a function to check if it is a permutation of a palin&shy; drome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.</p>
57

‎lcci/01.05.One Away/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.05. One Away](https://leetcode-cn.com/problems/one-away-lcci)
22

3+
[中文文档](/lcci/01.05.One%20Away/README.md)
4+
35
## Description
46
<p>There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.</p>
57

‎lcci/01.06.Compress String/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.06. Compress String](https://leetcode-cn.com/problems/compress-string-lcci)
22

3+
[中文文档](/lcci/01.06.Compress%20String/README.md)
4+
35
## Description
46
<p>Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the &quot;compressed&quot; string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a - z).</p>
57

‎lcci/01.07.Rotate Matrix/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.07. Rotate Matrix](https://leetcode-cn.com/problems/rotate-matrix-lcci)
22

3+
[中文文档](/lcci/01.07.Rotate%20Matrix/README.md)
4+
35
## Description
46
<p>Given an image represented by an N x N matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?</p>
57

‎lcci/01.08.Zero Matrix/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.08. Zero Matrix](https://leetcode-cn.com/problems/zero-matrix-lcci)
22

3+
[中文文档](/lcci/01.08.Zero%20Matrix/README.md)
4+
35
## Description
46
<p>Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.</p>
57

‎lcci/01.09.String Rotation/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [01.09. String Rotation](https://leetcode-cn.com/problems/string-rotation-lcci)
22

3+
[中文文档](/lcci/01.09.String%20Rotation/README.md)
4+
35
## Description
46
<p>Given two strings, <code>s1</code>&nbsp;and <code>s2</code>, write code to check if <code>s2</code> is a rotation of <code>s1</code> (e.g.,&quot;waterbottle&quot; is a rotation of&quot;erbottlewat&quot;).&nbsp;Can you use&nbsp;only one call to the method that&nbsp;checks if one word is a substring of another?</p>
57

‎lcci/02.01.Remove Duplicate Node/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
# [02.01. Remove Duplicate Node](https://leetcode-cn.com/problems/remove-duplicate-node-lcci)
22

3+
[中文文档](/lcci/02.01.Remove%20Duplicate%20Node/README.md)
4+
35
## Description
46
<p>Write code to remove duplicates from an unsorted linked list.</p>
57

0 commit comments

Comments
 (0)