|
102 | 102 | },
|
103 | 103 | {
|
104 | 104 | "cell_type": "code",
|
105 |
| - "execution_count": 28, |
| 105 | + "execution_count": 2, |
106 | 106 | "metadata": {},
|
107 | 107 | "outputs": [
|
108 | 108 | {
|
|
150 | 150 | "\n",
|
151 | 151 | "assert(split_num(\"-23.45\") == (23, 45))\n",
|
152 | 152 | "\n",
|
153 |
| - "num_str = input(\"Please input a number:\")\n", |
154 |
| - "if num_str.count('.') > 1:\n", |
| 153 | + "num = input(\"Please input a number:\")\n", |
| 154 | + "if num.count('.') > 1:\n", |
155 | 155 | " print(\"Input Error!\")\n",
|
156 | 156 | "else:\n",
|
157 |
| - " num_left, num_right = split_num(num_str)\n", |
| 157 | + " num_left, num_right = split_num(num)\n", |
158 | 158 | " \n",
|
159 | 159 | " sum = sum_digits(num_left)\n",
|
160 | 160 | " sum += sum_digits(num_right)\n",
|
161 |
| - " print(\"%s: The sum of the individual digits is %d\" % (num_str, sum))\n" |
| 161 | + " print(\"%s: The sum of the individual digits is %d\" % (num, sum))\n", |
| 162 | + "" |
162 | 163 | ]
|
163 | 164 | },
|
164 | 165 | {
|
165 | 166 | "cell_type": "code",
|
166 |
| - "execution_count": 31, |
| 167 | + "execution_count": 3, |
167 | 168 | "metadata": {},
|
168 | 169 | "outputs": [
|
169 | 170 | {
|
|
203 | 204 | "assert(is_prime_composite(2) == PRIME)\n",
|
204 | 205 | "assert(is_prime_composite(4) == COMPOSITE)\n",
|
205 | 206 | "\n",
|
206 |
| - "num_str = input(\"Please input a number:\")\n", |
207 |
| - "if num_str.count('.') >= 1:\n", |
208 |
| - " print(\"%s is neither prime nor composite\" % num_str)\n", |
| 207 | + "num = input(\"Please input a number:\")\n", |
| 208 | + "if num.count('.') >= 1:\n", |
| 209 | + " print(\"%s is neither prime nor composite\" % num)\n", |
209 | 210 | "else:\n",
|
210 |
| - " num_int = int(num_str)\n", |
| 211 | + " num = int(num)\n", |
211 | 212 | " \n",
|
212 |
| - " val = is_prime_composite(num_int)\n", |
| 213 | + " val = is_prime_composite(num)\n", |
213 | 214 | " if val == NO_PRIME_COMPOSITE:\n",
|
214 |
| - " print(\"%d is neither prime nor composite\" % num_int)\n", |
| 215 | + " print(\"%d is neither prime nor composite\" % num)\n", |
215 | 216 | " elif val == PRIME:\n",
|
216 |
| - " print(\"%d is a prime number\" % num_int)\n", |
| 217 | + " print(\"%d is a prime number\" % num)\n", |
217 | 218 | " else:\n",
|
218 |
| - " print(\"%d is a composite number\" % num_int)\n" |
| 219 | + " print(\"%d is a composite number\" % num)\n", |
| 220 | + "" |
219 | 221 | ]
|
220 | 222 | },
|
221 | 223 | {
|
|
242 | 244 | },
|
243 | 245 | {
|
244 | 246 | "cell_type": "code",
|
245 |
| - "execution_count": 38, |
| 247 | + "execution_count": 4, |
246 | 248 | "metadata": {},
|
247 | 249 | "outputs": [
|
248 | 250 | {
|
|
260 | 262 | "#\n",
|
261 | 263 | "# @Return: 删除重复项后的列表\n",
|
262 | 264 | "def rm_dups(target):\n",
|
263 |
| - " temp_list = []\n", |
264 |
| - " for element in target:\n", |
265 |
| - " if element not in temp_list:\n", |
266 |
| - " temp_list.append(element)\n", |
267 |
| - " return temp_list\n", |
| 265 | + " result = []\n", |
| 266 | + " for i in target:\n", |
| 267 | + " if i not in result:\n", |
| 268 | + " result.append(i)\n", |
| 269 | + " return result\n", |
268 | 270 | "\n",
|
269 | 271 | "\n",
|
270 | 272 | "assert(rm_dups([1, 2, 1]) == [1, 2])\n",
|
271 | 273 | "\n",
|
272 |
| - "original_list = ['a', 'b', 'a', 'd', 'd', 'c']\n", |
273 |
| - "print(\"The original list is:\", original_list)\n", |
| 274 | + "original = ['a', 'b', 'a', 'd', 'd', 'c']\n", |
| 275 | + "print(\"The original list is:\", original)\n", |
274 | 276 | "\n",
|
275 |
| - "final_list = rm_dups(original_list)\n", |
276 |
| - "# final_list = list(set(original_list))\n", |
277 |
| - "print(\"The list after removing duplicates is:\", final_list)\n", |
| 277 | + "final = rm_dups(original)\n", |
| 278 | + "# final = list(set(original))\n", |
| 279 | + "print(\"The list after removing duplicates is:\", final)\n", |
278 | 280 | "\n",
|
279 | 281 | "# *=====End File=====* #\n",
|
280 | 282 | ""
|
|
0 commit comments