Skip to content

Commit 165d1cd

Browse files
coder-xiaomocoder-xiaomo
committed
add problems
1 parent c533c20 commit 165d1cd

20 files changed

+2150
-0
lines changed

‎算法题/add-two-numbers.html

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
<p>You are given two <strong>non-empty</strong> linked lists representing two non-negative integers. The digits are stored in <strong>reverse order</strong>, and each of their nodes contains a single digit. Add the two numbers and return the sum&nbsp;as a linked list.</p>
2+
3+
<p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p>
4+
5+
<p>&nbsp;</p>
6+
<p><strong>Example 1:</strong></p>
7+
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg" style="width: 483px; height: 342px;" />
8+
<pre>
9+
<strong>Input:</strong> l1 = [2,4,3], l2 = [5,6,4]
10+
<strong>Output:</strong> [7,0,8]
11+
<strong>Explanation:</strong> 342 + 465 = 807.
12+
</pre>
13+
14+
<p><strong>Example 2:</strong></p>
15+
16+
<pre>
17+
<strong>Input:</strong> l1 = [0], l2 = [0]
18+
<strong>Output:</strong> [0]
19+
</pre>
20+
21+
<p><strong>Example 3:</strong></p>
22+
23+
<pre>
24+
<strong>Input:</strong> l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
25+
<strong>Output:</strong> [8,9,9,9,0,0,0,1]
26+
</pre>
27+
28+
<p>&nbsp;</p>
29+
<p><strong>Constraints:</strong></p>
30+
31+
<ul>
32+
<li>The number of nodes in each linked list is in the range <code>[1, 100]</code>.</li>
33+
<li><code>0 &lt;= Node.val &lt;= 9</code></li>
34+
<li>It is guaranteed that the list represents a number that does not have leading zeros.</li>
35+
</ul>

‎算法题/add-two-numbers.json

Lines changed: 185 additions & 0 deletions
Large diffs are not rendered by default.

‎算法题/longest-palindromic-substring.html

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
<p>Given a string <code>s</code>, return <em>the longest palindromic substring</em> in <code>s</code>.</p>
2+
3+
<p>&nbsp;</p>
4+
<p><strong>Example 1:</strong></p>
5+
6+
<pre>
7+
<strong>Input:</strong> s = &quot;babad&quot;
8+
<strong>Output:</strong> &quot;bab&quot;
9+
<strong>Explanation:</strong> &quot;aba&quot; is also a valid answer.
10+
</pre>
11+
12+
<p><strong>Example 2:</strong></p>
13+
14+
<pre>
15+
<strong>Input:</strong> s = &quot;cbbd&quot;
16+
<strong>Output:</strong> &quot;bb&quot;
17+
</pre>
18+
19+
<p>&nbsp;</p>
20+
<p><strong>Constraints:</strong></p>
21+
22+
<ul>
23+
<li><code>1 &lt;= s.length &lt;= 1000</code></li>
24+
<li><code>s</code> consist of only digits and English letters.</li>
25+
</ul>

‎算法题/longest-palindromic-substring.json

Lines changed: 176 additions & 0 deletions
Large diffs are not rendered by default.

‎算法题/longest-substring-without-repeating-characters.html

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
<p>Given a string <code>s</code>, find the length of the <strong>longest substring</strong> without repeating characters.</p>
2+
3+
<p>&nbsp;</p>
4+
<p><strong>Example 1:</strong></p>
5+
6+
<pre>
7+
<strong>Input:</strong> s = &quot;abcabcbb&quot;
8+
<strong>Output:</strong> 3
9+
<strong>Explanation:</strong> The answer is &quot;abc&quot;, with the length of 3.
10+
</pre>
11+
12+
<p><strong>Example 2:</strong></p>
13+
14+
<pre>
15+
<strong>Input:</strong> s = &quot;bbbbb&quot;
16+
<strong>Output:</strong> 1
17+
<strong>Explanation:</strong> The answer is &quot;b&quot;, with the length of 1.
18+
</pre>
19+
20+
<p><strong>Example 3:</strong></p>
21+
22+
<pre>
23+
<strong>Input:</strong> s = &quot;pwwkew&quot;
24+
<strong>Output:</strong> 3
25+
<strong>Explanation:</strong> The answer is &quot;wke&quot;, with the length of 3.
26+
Notice that the answer must be a substring, &quot;pwke&quot; is a subsequence and not a substring.
27+
</pre>
28+
29+
<p>&nbsp;</p>
30+
<p><strong>Constraints:</strong></p>
31+
32+
<ul>
33+
<li><code>0 &lt;= s.length &lt;= 5 * 10<sup>4</sup></code></li>
34+
<li><code>s</code> consists of English letters, digits, symbols and spaces.</li>
35+
</ul>

‎算法题/longest-substring-without-repeating-characters.json

Lines changed: 178 additions & 0 deletions
Large diffs are not rendered by default.

‎算法题/median-of-two-sorted-arrays.html

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
<p>Given two sorted arrays <code>nums1</code> and <code>nums2</code> of size <code>m</code> and <code>n</code> respectively, return <strong>the median</strong> of the two sorted arrays.</p>
2+
3+
<p>The overall run time complexity should be <code>O(log (m+n))</code>.</p>
4+
5+
<p>&nbsp;</p>
6+
<p><strong>Example 1:</strong></p>
7+
8+
<pre>
9+
<strong>Input:</strong> nums1 = [1,3], nums2 = [2]
10+
<strong>Output:</strong> 2.00000
11+
<strong>Explanation:</strong> merged array = [1,2,3] and median is 2.
12+
</pre>
13+
14+
<p><strong>Example 2:</strong></p>
15+
16+
<pre>
17+
<strong>Input:</strong> nums1 = [1,2], nums2 = [3,4]
18+
<strong>Output:</strong> 2.50000
19+
<strong>Explanation:</strong> merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
20+
</pre>
21+
22+
<p>&nbsp;</p>
23+
<p><strong>Constraints:</strong></p>
24+
25+
<ul>
26+
<li><code>nums1.length == m</code></li>
27+
<li><code>nums2.length == n</code></li>
28+
<li><code>0 &lt;= m &lt;= 1000</code></li>
29+
<li><code>0 &lt;= n &lt;= 1000</code></li>
30+
<li><code>1 &lt;= m + n &lt;= 2000</code></li>
31+
<li><code>-10<sup>6</sup> &lt;= nums1[i], nums2[i] &lt;= 10<sup>6</sup></code></li>
32+
</ul>

‎算法题/median-of-two-sorted-arrays.json

Lines changed: 171 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,171 @@
1+
{
2+
"data": {
3+
"question": {
4+
"questionId": "4",
5+
"questionFrontendId": "4",
6+
"boundTopicId": null,
7+
"title": "Median of Two Sorted Arrays",
8+
"titleSlug": "median-of-two-sorted-arrays",
9+
"content": "<p>Given two sorted arrays <code>nums1</code> and <code>nums2</code> of size <code>m</code> and <code>n</code> respectively, return <strong>the median</strong> of the two sorted arrays.</p>\n\n<p>The overall run time complexity should be <code>O(log (m+n))</code>.</p>\n\n<p>&nbsp;</p>\n<p><strong>Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums1 = [1,3], nums2 = [2]\n<strong>Output:</strong> 2.00000\n<strong>Explanation:</strong> merged array = [1,2,3] and median is 2.\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> nums1 = [1,2], nums2 = [3,4]\n<strong>Output:</strong> 2.50000\n<strong>Explanation:</strong> merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.\n</pre>\n\n<p>&nbsp;</p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>nums1.length == m</code></li>\n\t<li><code>nums2.length == n</code></li>\n\t<li><code>0 &lt;= m &lt;= 1000</code></li>\n\t<li><code>0 &lt;= n &lt;= 1000</code></li>\n\t<li><code>1 &lt;= m + n &lt;= 2000</code></li>\n\t<li><code>-10<sup>6</sup> &lt;= nums1[i], nums2[i] &lt;= 10<sup>6</sup></code></li>\n</ul>\n",
10+
"translatedTitle": null,
11+
"translatedContent": null,
12+
"isPaidOnly": false,
13+
"difficulty": "Hard",
14+
"likes": 15641,
15+
"dislikes": 1936,
16+
"isLiked": null,
17+
"similarQuestions": "[]",
18+
"exampleTestcases": "[1,3]\n[2]\n[1,2]\n[3,4]",
19+
"categoryTitle": "Algorithms",
20+
"contributors": [],
21+
"topicTags": [
22+
{
23+
"name": "Array",
24+
"slug": "array",
25+
"translatedName": null,
26+
"__typename": "TopicTagNode"
27+
},
28+
{
29+
"name": "Binary Search",
30+
"slug": "binary-search",
31+
"translatedName": null,
32+
"__typename": "TopicTagNode"
33+
},
34+
{
35+
"name": "Divide and Conquer",
36+
"slug": "divide-and-conquer",
37+
"translatedName": null,
38+
"__typename": "TopicTagNode"
39+
}
40+
],
41+
"companyTagStats": null,
42+
"codeSnippets": [
43+
{
44+
"lang": "C++",
45+
"langSlug": "cpp",
46+
"code": "class Solution {\npublic:\n double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {\n \n }\n};",
47+
"__typename": "CodeSnippetNode"
48+
},
49+
{
50+
"lang": "Java",
51+
"langSlug": "java",
52+
"code": "class Solution {\n public double findMedianSortedArrays(int[] nums1, int[] nums2) {\n \n }\n}",
53+
"__typename": "CodeSnippetNode"
54+
},
55+
{
56+
"lang": "Python",
57+
"langSlug": "python",
58+
"code": "class Solution(object):\n def findMedianSortedArrays(self, nums1, nums2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :rtype: float\n \"\"\"\n ",
59+
"__typename": "CodeSnippetNode"
60+
},
61+
{
62+
"lang": "Python3",
63+
"langSlug": "python3",
64+
"code": "class Solution:\n def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:\n ",
65+
"__typename": "CodeSnippetNode"
66+
},
67+
{
68+
"lang": "C",
69+
"langSlug": "c",
70+
"code": "\n\ndouble findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){\n\n}",
71+
"__typename": "CodeSnippetNode"
72+
},
73+
{
74+
"lang": "C#",
75+
"langSlug": "csharp",
76+
"code": "public class Solution {\n public double FindMedianSortedArrays(int[] nums1, int[] nums2) {\n \n }\n}",
77+
"__typename": "CodeSnippetNode"
78+
},
79+
{
80+
"lang": "JavaScript",
81+
"langSlug": "javascript",
82+
"code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar findMedianSortedArrays = function(nums1, nums2) {\n \n};",
83+
"__typename": "CodeSnippetNode"
84+
},
85+
{
86+
"lang": "Ruby",
87+
"langSlug": "ruby",
88+
"code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @return {Float}\ndef find_median_sorted_arrays(nums1, nums2)\n \nend",
89+
"__typename": "CodeSnippetNode"
90+
},
91+
{
92+
"lang": "Swift",
93+
"langSlug": "swift",
94+
"code": "class Solution {\n func findMedianSortedArrays(_ nums1: [Int], _ nums2: [Int]) -> Double {\n \n }\n}",
95+
"__typename": "CodeSnippetNode"
96+
},
97+
{
98+
"lang": "Go",
99+
"langSlug": "golang",
100+
"code": "func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {\n \n}",
101+
"__typename": "CodeSnippetNode"
102+
},
103+
{
104+
"lang": "Scala",
105+
"langSlug": "scala",
106+
"code": "object Solution {\n def findMedianSortedArrays(nums1: Array[Int], nums2: Array[Int]): Double = {\n \n }\n}",
107+
"__typename": "CodeSnippetNode"
108+
},
109+
{
110+
"lang": "Kotlin",
111+
"langSlug": "kotlin",
112+
"code": "class Solution {\n fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {\n \n }\n}",
113+
"__typename": "CodeSnippetNode"
114+
},
115+
{
116+
"lang": "Rust",
117+
"langSlug": "rust",
118+
"code": "impl Solution {\n pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {\n \n }\n}",
119+
"__typename": "CodeSnippetNode"
120+
},
121+
{
122+
"lang": "PHP",
123+
"langSlug": "php",
124+
"code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @return Float\n */\n function findMedianSortedArrays($nums1, $nums2) {\n \n }\n}",
125+
"__typename": "CodeSnippetNode"
126+
},
127+
{
128+
"lang": "TypeScript",
129+
"langSlug": "typescript",
130+
"code": "function findMedianSortedArrays(nums1: number[], nums2: number[]): number {\n\n};",
131+
"__typename": "CodeSnippetNode"
132+
},
133+
{
134+
"lang": "Racket",
135+
"langSlug": "racket",
136+
"code": "(define/contract (find-median-sorted-arrays nums1 nums2)\n (-> (listof exact-integer?) (listof exact-integer?) flonum?)\n\n )",
137+
"__typename": "CodeSnippetNode"
138+
},
139+
{
140+
"lang": "Erlang",
141+
"langSlug": "erlang",
142+
"code": "-spec find_median_sorted_arrays(Nums1 :: [integer()], Nums2 :: [integer()]) -> float().\nfind_median_sorted_arrays(Nums1, Nums2) ->\n .",
143+
"__typename": "CodeSnippetNode"
144+
},
145+
{
146+
"lang": "Elixir",
147+
"langSlug": "elixir",
148+
"code": "defmodule Solution do\n @spec find_median_sorted_arrays(nums1 :: [integer], nums2 :: [integer]) :: float\n def find_median_sorted_arrays(nums1, nums2) do\n\n end\nend",
149+
"__typename": "CodeSnippetNode"
150+
}
151+
],
152+
"stats": "{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.9M\", \"totalAcceptedRaw\": 1312822, \"totalSubmissionRaw\": 3874786, \"acRate\": \"33.9%\"}",
153+
"hints": [],
154+
"solution": null,
155+
"status": null,
156+
"sampleTestCase": "[1,3]\n[2]",
157+
"metaData": "{\r\n \"name\": \"findMedianSortedArrays\",\r\n \"params\": [\r\n {\r\n \"name\": \"nums1\",\r\n \"type\": \"integer[]\"\r\n },\r\n {\r\n \"name\": \"nums2\",\r\n \"type\": \"integer[]\"\r\n }\r\n ],\r\n \"return\": {\r\n \"type\": \"double\"\r\n }\r\n}",
158+
"judgerAvailable": true,
159+
"judgeType": "large",
160+
"mysqlSchemas": [],
161+
"enableRunCode": true,
162+
"enableTestMode": false,
163+
"enableDebugger": true,
164+
"envInfo": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 11 </code> using the latest C++ 17 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code> OpenJDK 17 </code>. Java 8 features such as lambda expressions and stream API can be used. </p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/2/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/2/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/2/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 8.2</code> using the gnu99 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>2. Looking up an item in a hash:</b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://docs.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-9\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\\r\\n\\r\\n<p>Your code is compiled with debug flag enabled (<code>/debug</code>).</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use <a href=\\\"https://github.com/datastructures-js/priority-queue\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and <a href=\\\"https://github.com/datastructures-js/queue\\\" target=\\\"_blank\\\">datastructures-js/queue</a>.</p>\"], \"ruby\": [\"Ruby\", \"<p><code>Ruby 3.1</code></p>\\r\\n\\r\\n<p>Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms</p>\"], \"swift\": [\"Swift\", \"<p><code>Swift 5.5.2</code>.</p>\"], \"golang\": [\"Go\", \"<p><code>Go 1.17.6</code>.</p>\\r\\n\\r\\n<p>Support <a href=\\\"https://godoc.org/github.com/emirpasic/gods\\\" target=\\\"_blank\\\">https://godoc.org/github.com/emirpasic/gods</a> library.</p>\"], \"python3\": [\"Python3\", \"<p><code>Python 3.10</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/3/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/3/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/3/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\"], \"scala\": [\"Scala\", \"<p><code>Scala 2.13.7</code>.</p>\"], \"kotlin\": [\"Kotlin\", \"<p><code>Kotlin 1.3.10</code>.</p>\"], \"rust\": [\"Rust\", \"<p><code>Rust 1.58.1</code></p>\\r\\n\\r\\n<p>Supports <a href=\\\"https://crates.io/crates/rand\\\" target=\\\"_blank\\\">rand </a> v0.6\\u00a0from crates.io</p>\"], \"php\": [\"PHP\", \"<p><code>PHP 8.1</code>.</p>\\r\\n<p>With bcmath module</p>\"], \"typescript\": [\"Typescript\", \"<p><code>TypeScript 4.5.4, Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES2020 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\"], \"racket\": [\"Racket\", \"<p>Run with <code>Racket 8.3</code>.</p>\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}",
165+
"libraryUrl": null,
166+
"adminUrl": null,
167+
"challengeQuestion": null,
168+
"__typename": "QuestionNode"
169+
}
170+
}
171+
}

0 commit comments

Comments
 (0)