Skip to content

Commit 3f9d239

Browse files
committed
add my solutions
1 parent e3a6dbc commit 3f9d239

File tree

33 files changed

+30
-439
lines changed

33 files changed

+30
-439
lines changed

README.md

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -18,18 +18,18 @@
1818

1919
| # | Problems | Solutions | Difficulty | Acceptance | Paid-Only
2020
|:--:|:-----:|:---------:|:----:|:----:|:----:|
21-
|001|[two-sum](https://leetcode.com/problems/two-sum/)| [python](./solutions/001.two-sum/two-sum.py)|Easy|34.13%||
22-
|002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)| [c](./solutions/002.add-two-numbers/add-two-numbers.c)|Medium|27.64%||
23-
|003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [javascript](./solutions/003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.js)|Medium|24.27%||
24-
|007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](./solutions/007.reverse-integer/reverse-integer.c)|Easy|24.32%||
25-
|009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](./solutions/009.palindrome-number/palindrome-number.py)|Easy|35.20%||
26-
|013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)| [python](./solutions/013.roman-to-integer/roman-to-integer.py)|Easy|45.52%||
27-
|014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)| [c++](./solutions/014.longest-common-prefix/longest-common-prefix.cpp)|Easy|31.44%||
28-
|019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [c](./solutions/019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.c)|Medium|33.34%||
29-
|026|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [c](./solutions/026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.c)|Easy|35.50%||
30-
|027|[remove-element](https://leetcode.com/problems/remove-element/)| [c++](./solutions/027.remove-element/remove-element.cpp)|Easy|38.84%||
31-
|028|[implement-strstr](https://leetcode.com/problems/implement-strstr/)| [c++](./solutions/028.implement-strstr/implement-strstr.cpp)|Easy|27.97%||
32-
|035|[search-insert-position](https://leetcode.com/problems/search-insert-position/)| [c](./solutions/035.search-insert-position/search-insert-position.c)|Easy|39.66%||
33-
|056|[merge-intervals](https://leetcode.com/problems/merge-intervals/)| [javascript](./solutions/056.merge-intervals/merge-intervals.js)|Medium|29.89%||
34-
|061|[rotate-list](https://leetcode.com/problems/rotate-list/)| [c](./solutions/061.rotate-list/rotate-list.c)|Medium|24.34%||
21+
|001|[two-sum](https://leetcode.com/problems/two-sum/)| [python](.//001.two-sum/two-sum.py)|Easy|||
22+
|002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)| [c](.//002.add-two-numbers/add-two-numbers.c)|Medium|||
23+
|003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [javascript](.//003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.js)|Medium|||
24+
|007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](.//007.reverse-integer/reverse-integer.c)|Easy|||
25+
|009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](.//009.palindrome-number/palindrome-number.py)|Easy|||
26+
|013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)| [python](.//013.roman-to-integer/roman-to-integer.py)|Easy|||
27+
|014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)| [c++](.//014.longest-common-prefix/longest-common-prefix.cpp)|Easy|||
28+
|019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [c](.//019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.c)|Medium|||
29+
|026|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [c](.//026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.c)|Easy|||
30+
|027|[remove-element](https://leetcode.com/problems/remove-element/)| [c++](.//027.remove-element/remove-element.cpp)|Easy|||
31+
|028|[implement-strstr](https://leetcode.com/problems/implement-strstr/)| [c++](.//028.implement-strstr/implement-strstr.cpp)|Easy|27.97%||
32+
|035|[search-insert-position](https://leetcode.com/problems/search-insert-position/)| [c](.//035.search-insert-position/search-insert-position.c)|Easy|||
33+
|056|[merge-intervals](https://leetcode.com/problems/merge-intervals/)| [javascript](.//056.merge-intervals/merge-intervals.js)|Medium|||
34+
|061|[rotate-list](https://leetcode.com/problems/rotate-list/)| [c](.//061.rotate-list/rotate-list.c)|Medium|||
3535

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
{"c++":"class Solution {\npublic:\n int strStr(string haystack, string needle) {\n if (needle.size() == 0) {\n return 0;\n }\n int i = 0, j = 0;\n int m = haystack.size(), n = needle.size();\n while(i <= (m - n)) {\n j = 0;\n while(haystack[i] == needle[j]) {\n i++;\n j++;\n if (j == n) {\n return (i - n);\n }\n }\n i = i - j + 1;\n }\n return -1;\n }\n};"}

solutions/README.md

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -18,18 +18,18 @@
1818

1919
| # | Problems | Solutions | Difficulty | Acceptance | Paid-Only
2020
|:--:|:-----:|:---------:|:----:|:----:|:----:|
21-
|001|[two-sum](https://leetcode.com/problems/two-sum/)| [python](.&#x2F;solutions&#x2F;001.two-sum&#x2F;two-sum.py)|Easy|34.13%||
22-
|002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)| [c](.&#x2F;solutions&#x2F;002.add-two-numbers&#x2F;add-two-numbers.c)|Medium|27.64%||
23-
|003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [javascript](.&#x2F;solutions&#x2F;003.longest-substring-without-repeating-characters&#x2F;longest-substring-without-repeating-characters.js)|Medium|24.27%||
24-
|007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](.&#x2F;solutions&#x2F;007.reverse-integer&#x2F;reverse-integer.c)|Easy|24.32%||
25-
|009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](.&#x2F;solutions&#x2F;009.palindrome-number&#x2F;palindrome-number.py)|Easy|35.20%||
26-
|013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)| [python](.&#x2F;solutions&#x2F;013.roman-to-integer&#x2F;roman-to-integer.py)|Easy|45.52%||
27-
|014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)| [c++](.&#x2F;solutions&#x2F;014.longest-common-prefix&#x2F;longest-common-prefix.cpp)|Easy|31.44%||
28-
|019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [c](.&#x2F;solutions&#x2F;019.remove-nth-node-from-end-of-list&#x2F;remove-nth-node-from-end-of-list.c)|Medium|33.34%||
29-
|026|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [c](.&#x2F;solutions&#x2F;026.remove-duplicates-from-sorted-array&#x2F;remove-duplicates-from-sorted-array.c)|Easy|35.50%||
30-
|027|[remove-element](https://leetcode.com/problems/remove-element/)| [c++](.&#x2F;solutions&#x2F;027.remove-element&#x2F;remove-element.cpp)|Easy|38.84%||
31-
|028|[implement-strstr](https://leetcode.com/problems/implement-strstr/)| [c++](.&#x2F;solutions&#x2F;028.implement-strstr&#x2F;implement-strstr.cpp)|Easy|27.97%||
32-
|035|[search-insert-position](https://leetcode.com/problems/search-insert-position/)| [c](.&#x2F;solutions&#x2F;035.search-insert-position&#x2F;search-insert-position.c)|Easy|39.66%||
33-
|056|[merge-intervals](https://leetcode.com/problems/merge-intervals/)| [javascript](.&#x2F;solutions&#x2F;056.merge-intervals&#x2F;merge-intervals.js)|Medium|29.89%||
34-
|061|[rotate-list](https://leetcode.com/problems/rotate-list/)| [c](.&#x2F;solutions&#x2F;061.rotate-list&#x2F;rotate-list.c)|Medium|24.34%||
21+
|001|[two-sum](https://leetcode.com/problems/two-sum/)| [python](.&#x2F;&#x2F;001.two-sum&#x2F;two-sum.py)|Easy|||
22+
|002|[add-two-numbers](https://leetcode.com/problems/add-two-numbers/)| [c](.&#x2F;&#x2F;002.add-two-numbers&#x2F;add-two-numbers.c)|Medium|||
23+
|003|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [javascript](.&#x2F;&#x2F;003.longest-substring-without-repeating-characters&#x2F;longest-substring-without-repeating-characters.js)|Medium|||
24+
|007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](.&#x2F;&#x2F;007.reverse-integer&#x2F;reverse-integer.c)|Easy|||
25+
|009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](.&#x2F;&#x2F;009.palindrome-number&#x2F;palindrome-number.py)|Easy|||
26+
|013|[roman-to-integer](https://leetcode.com/problems/roman-to-integer/)| [python](.&#x2F;&#x2F;013.roman-to-integer&#x2F;roman-to-integer.py)|Easy|||
27+
|014|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/)| [c++](.&#x2F;&#x2F;014.longest-common-prefix&#x2F;longest-common-prefix.cpp)|Easy|||
28+
|019|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [c](.&#x2F;&#x2F;019.remove-nth-node-from-end-of-list&#x2F;remove-nth-node-from-end-of-list.c)|Medium|||
29+
|026|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [c](.&#x2F;&#x2F;026.remove-duplicates-from-sorted-array&#x2F;remove-duplicates-from-sorted-array.c)|Easy|||
30+
|027|[remove-element](https://leetcode.com/problems/remove-element/)| [c++](.&#x2F;&#x2F;027.remove-element&#x2F;remove-element.cpp)|Easy|||
31+
|028|[implement-strstr](https://leetcode.com/problems/implement-strstr/)| [c++](.&#x2F;&#x2F;028.implement-strstr&#x2F;implement-strstr.cpp)|Easy|27.97%||
32+
|035|[search-insert-position](https://leetcode.com/problems/search-insert-position/)| [c](.&#x2F;&#x2F;035.search-insert-position&#x2F;search-insert-position.c)|Easy|||
33+
|056|[merge-intervals](https://leetcode.com/problems/merge-intervals/)| [javascript](.&#x2F;&#x2F;056.merge-intervals&#x2F;merge-intervals.js)|Medium|||
34+
|061|[rotate-list](https://leetcode.com/problems/rotate-list/)| [c](.&#x2F;&#x2F;061.rotate-list&#x2F;rotate-list.c)|Medium|||
3535

solutions/result.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1 @@
1-
{"1":{"id":1,"level":1,"title":"two-sum","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","language":["javascript"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","language":["c"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","language":["c++"],"generated":true},"35":{"id":35,"level":1,"title":"search-insert-position","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","language":["c"],"generated":true},"lastUpdatedTime":"2017-07-27","total":573,"solved":13,"locked":107}
1+
{"1":{"id":1,"level":1,"title":"two-sum","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","language":["javascript"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","language":["c"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","language":["c++"],"generated":true},"28":{"id":28,"level":1,"title":"implement-strstr","paidOnly":false,"acceptance":"27.97%","language":["c++"],"generated":true},"35":{"id":35,"level":1,"title":"search-insert-position","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","language":["c"],"generated":true},"lastUpdatedTime":"2017-07-28","total":573,"solved":14,"locked":107}

solutions/solutions/001.two-sum/question.md

Lines changed: 0 additions & 12 deletions
This file was deleted.

solutions/solutions/001.two-sum/two-sum.py

Lines changed: 0 additions & 10 deletions
This file was deleted.

solutions/solutions/002.add-two-numbers/add-two-numbers.c

Lines changed: 0 additions & 73 deletions
This file was deleted.

solutions/solutions/002.add-two-numbers/question.md

Lines changed: 0 additions & 7 deletions
This file was deleted.

solutions/solutions/003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.js

Lines changed: 0 additions & 14 deletions
This file was deleted.

solutions/solutions/003.longest-substring-without-repeating-characters/question.md

Lines changed: 0 additions & 9 deletions
This file was deleted.

solutions/solutions/007.reverse-integer/question.md

Lines changed: 0 additions & 25 deletions
This file was deleted.

solutions/solutions/007.reverse-integer/reverse-integer.c

Lines changed: 0 additions & 9 deletions
This file was deleted.

solutions/solutions/009.palindrome-number/palindrome-number.py

Lines changed: 0 additions & 14 deletions
This file was deleted.

solutions/solutions/009.palindrome-number/question.md

Lines changed: 0 additions & 14 deletions
This file was deleted.

solutions/solutions/013.roman-to-integer/question.md

Lines changed: 0 additions & 3 deletions
This file was deleted.

solutions/solutions/013.roman-to-integer/roman-to-integer.py

Lines changed: 0 additions & 21 deletions
This file was deleted.

0 commit comments

Comments
 (0)