Skip to content

Commit 0ec968f

Browse files
committed
😄update my solutions
1 parent 6c19c83 commit 0ec968f

File tree

5 files changed

+45
-4
lines changed

5 files changed

+45
-4
lines changed

README.md

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,16 @@
11
<p align="center"><img width="300" src="https://raw.githubusercontent.com/Ma63d/leetcode-spider/master/img/site-logo.png"></p>
22
<p align="center">
3-
<img src="https://img.shields.io/badge/Solved/Total(Locked)-17/577(107)-green.svg?style=flat-square" alt="">
3+
<img src="https://img.shields.io/badge/Solved/Total(Locked)-18/577(109)-green.svg?style=flat-square" alt="">
44
<img src="https://img.shields.io/badge/Hard-0-blue.svg?style=flat-square" alt="">
5-
<img src="https://img.shields.io/badge/Medium-8-blue.svg?style=flat-square" alt="">
5+
<img src="https://img.shields.io/badge/Medium-9-blue.svg?style=flat-square" alt="">
66
<img src="https://img.shields.io/badge/Easy-9-blue.svg?style=flat-square" alt="">
77
</p>
88
<h3 align="center">My leetcode solutions</h3>
99

1010
<p align="center">
1111
<b>Language: javascript python python3 c++ c</b>
1212
<br>
13-
<b>Last updated: 2017-07-31</b>
13+
<b>Last updated: 2017-08-05</b>
1414
<br><br>
1515
</p>
1616
<!--请保留下面这行信息,让更多用户了解到这个小爬虫,衷心感谢您的支持-->
@@ -22,6 +22,7 @@
2222
|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%||
2323
|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%||
2424
|005|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring/)| [c++](.&#x2F;solutions&#x2F;005.longest-palindromic-substring&#x2F;longest-palindromic-substring.cpp)|Medium|25.17%||
25+
|006|[zigzag-conversion](https://leetcode.com/problems/zigzag-conversion/)| [c++](.&#x2F;solutions&#x2F;006.zigzag-conversion&#x2F;zigzag-conversion.cpp)|Medium|26.73%||
2526
|007|[reverse-integer](https://leetcode.com/problems/reverse-integer/)| [c](.&#x2F;solutions&#x2F;007.reverse-integer&#x2F;reverse-integer.c)|Easy|24.32%||
2627
|008|[string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi/)| [c++](.&#x2F;solutions&#x2F;008.string-to-integer-atoi&#x2F;string-to-integer-atoi.cpp)|Medium|13.96%||
2728
|009|[palindrome-number](https://leetcode.com/problems/palindrome-number/)| [python](.&#x2F;solutions&#x2F;009.palindrome-number&#x2F;palindrome-number.py)|Easy|35.20%||
Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
{"c++":"class Solution {\npublic:\n string convert(string s, int numRows) {\n if (numRows == 1 || numRows > s.size()) {\n return s;\n }\n vector<string> array(numRows, \"\");\n for (int i = 0; i < s.size(); ++i) {\n int index = i % (numRows - 1);\n int flag = i / (numRows - 1);\n if (flag % 2 == 0) {\n array[index] += s[i];\n } else {\n array[numRows - 1 - index] += s[i];\n }\n }\n string result = \"\";\n for (int i = 0; i < array.size(); ++i) {\n result += array[i];\n }\n return result;\n }\n};"}
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
2+
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
3+
4+
P A H N
5+
A P L S I I G
6+
Y I R
7+
8+
9+
And then read line by line: "PAHNAPLSIIGYIR"
10+
11+
12+
Write the code that will take a string and make this conversion given a number of rows:
13+
14+
string convert(string text, int nRows);
15+
16+
convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".
Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
class Solution {
2+
public:
3+
string convert(string s, int numRows) {
4+
if (numRows == 1 || numRows > s.size()) {
5+
return s;
6+
}
7+
vector<string> array(numRows, "");
8+
for (int i = 0; i < s.size(); ++i) {
9+
int index = i % (numRows - 1);
10+
int flag = i / (numRows - 1);
11+
if (flag % 2 == 0) {
12+
array[index] += s[i];
13+
} else {
14+
array[numRows - 1 - index] += s[i];
15+
}
16+
}
17+
string result = "";
18+
for (int i = 0; i < array.size(); ++i) {
19+
result += array[i];
20+
}
21+
return result;
22+
}
23+
};

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","paidOnly":false,"acceptance":"34.13%","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","paidOnly":false,"acceptance":"27.64%","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","paidOnly":false,"acceptance":"24.27%","language":["javascript"],"generated":true},"5":{"id":5,"level":2,"title":"longest-palindromic-substring","paidOnly":false,"acceptance":"25.17%","language":["c++"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","paidOnly":false,"acceptance":"24.32%","language":["c"],"generated":true},"8":{"id":8,"level":2,"title":"string-to-integer-atoi","paidOnly":false,"acceptance":"13.96%","language":["c++"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","paidOnly":false,"acceptance":"35.20%","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","paidOnly":false,"acceptance":"45.52%","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","paidOnly":false,"acceptance":"31.44%","language":["c++"],"generated":true},"15":{"id":15,"level":2,"title":"3sum","paidOnly":false,"acceptance":"21.59%","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","paidOnly":false,"acceptance":"33.34%","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","paidOnly":false,"acceptance":"35.50%","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","paidOnly":false,"acceptance":"38.84%","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","paidOnly":false,"acceptance":"39.66%","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","paidOnly":false,"acceptance":"29.89%","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","paidOnly":false,"acceptance":"24.34%","language":["c"],"generated":true},"lastUpdatedTime":"2017-07-31","total":577,"solved":17,"locked":107}
1+
{"1":{"id":1,"level":1,"title":"two-sum","paidOnly":false,"acceptance":"34.13%","language":["python"],"generated":true},"2":{"id":2,"level":2,"title":"add-two-numbers","paidOnly":false,"acceptance":"27.64%","language":["c"],"generated":true},"3":{"id":3,"level":2,"title":"longest-substring-without-repeating-characters","paidOnly":false,"acceptance":"24.27%","language":["javascript"],"generated":true},"5":{"id":5,"level":2,"title":"longest-palindromic-substring","paidOnly":false,"acceptance":"25.17%","language":["c++"],"generated":true},"6":{"id":6,"level":2,"title":"zigzag-conversion","paidOnly":false,"acceptance":"26.73%","language":["c++"],"generated":true},"7":{"id":7,"level":1,"title":"reverse-integer","paidOnly":false,"acceptance":"24.32%","language":["c"],"generated":true},"8":{"id":8,"level":2,"title":"string-to-integer-atoi","paidOnly":false,"acceptance":"13.96%","language":["c++"],"generated":true},"9":{"id":9,"level":1,"title":"palindrome-number","paidOnly":false,"acceptance":"35.20%","language":["python"],"generated":true},"13":{"id":13,"level":1,"title":"roman-to-integer","paidOnly":false,"acceptance":"45.52%","language":["python"],"generated":true},"14":{"id":14,"level":1,"title":"longest-common-prefix","paidOnly":false,"acceptance":"31.44%","language":["c++"],"generated":true},"15":{"id":15,"level":2,"title":"3sum","paidOnly":false,"acceptance":"21.59%","language":["c++"],"generated":true},"19":{"id":19,"level":2,"title":"remove-nth-node-from-end-of-list","paidOnly":false,"acceptance":"33.34%","language":["c"],"generated":true},"26":{"id":26,"level":1,"title":"remove-duplicates-from-sorted-array","paidOnly":false,"acceptance":"35.50%","language":["c"],"generated":true},"27":{"id":27,"level":1,"title":"remove-element","paidOnly":false,"acceptance":"38.84%","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","paidOnly":false,"acceptance":"39.66%","language":["c"],"generated":true},"56":{"id":56,"level":2,"title":"merge-intervals","paidOnly":false,"acceptance":"29.89%","language":["javascript"],"generated":true},"61":{"id":61,"level":2,"title":"rotate-list","paidOnly":false,"acceptance":"24.34%","language":["c"],"generated":true},"lastUpdatedTime":"2017-08-05","total":577,"solved":18,"locked":109}

0 commit comments

Comments
 (0)