-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
704 lines (446 loc) · 157 KB
/
index.html
File metadata and controls
704 lines (446 loc) · 157 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>SB-Dev-Note</title>
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
<meta property="og:type" content="website">
<meta property="og:title" content="SB-Dev-Note">
<meta property="og:url" content="http://yoursite.com/index.html">
<meta property="og:site_name" content="SB-Dev-Note">
<meta property="og:locale" content="en_US">
<meta property="article:author" content="Sunbin Vincent Kim">
<meta name="twitter:card" content="summary">
<link rel="alternate" href="/atom.xml" title="SB-Dev-Note" type="application/atom+xml">
<link rel="icon" href="/favicon.png">
<link href="//fonts.googleapis.com/css?family=Source+Code+Pro" rel="stylesheet" type="text/css">
<link rel="stylesheet" href="/css/style.css">
<meta name="generator" content="Hexo 4.2.0"></head>
<body>
<div id="container">
<div id="wrap">
<header id="header">
<div id="banner"></div>
<div id="header-outer" class="outer">
<div id="header-title" class="inner">
<h1 id="logo-wrap">
<a href="/" id="logo">SB-Dev-Note</a>
</h1>
</div>
<div id="header-inner" class="inner">
<nav id="main-nav">
<a id="main-nav-toggle" class="nav-icon"></a>
<a class="main-nav-link" href="/">Home</a>
<a class="main-nav-link" href="/archives">Archives</a>
</nav>
<nav id="sub-nav">
<a id="nav-rss-link" class="nav-icon" href="/atom.xml" title="RSS Feed"></a>
<a id="nav-search-btn" class="nav-icon" title="Search"></a>
</nav>
<div id="search-form-wrap">
<form action="//google.com/search" method="get" accept-charset="UTF-8" class="search-form"><input type="search" name="q" class="search-form-input" placeholder="Search"><button type="submit" class="search-form-submit"></button><input type="hidden" name="sitesearch" value="http://yoursite.com"></form>
</div>
</div>
</div>
</header>
<div class="outer">
<section id="main">
<article id="post-pythoncodefight-day19" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/10/pythoncodefight-day19/" class="article-date">
<time datetime="2020-02-09T15:24:28.000Z" itemprop="datePublished">2020-02-10</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/10/pythoncodefight-day19/">PythonCodeFight-Day19</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-19"><a href="#Day-19" class="headerlink" title="Day 19"></a>Day 19</h1><h1 id="Q25-Minesweeper"><a href="#Q25-Minesweeper" class="headerlink" title="Q25. Minesweeper"></a>Q25. Minesweeper</h1><p>In the popular Minesweeper game you have a board with some mines and those cells that don’t contain a mine have a number in it that indicates the total number of mines in the neighboring cells. Starting off with some arrangement of mines we want to create a Minesweeper game setup.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">minesweeper</span><span class="params">(matrix)</span>:</span></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">minesweeper</span><span class="params">(matrix)</span>:</span></span><br><span class="line"> row = len(matrix)</span><br><span class="line"> col = len(matrix[<span class="number">0</span>])</span><br><span class="line"></span><br><span class="line"> MineCounterMat = np.zeros((row, col))</span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> idx_row <span class="keyword">in</span> range(row):</span><br><span class="line"> <span class="keyword">for</span> idx_col <span class="keyword">in</span> range(col): </span><br><span class="line"> MineCounter = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> idx_row == <span class="number">0</span>:</span><br><span class="line"> idx_row_set = [idx_row, idx_row + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">elif</span> idx_row == row<span class="number">-1</span>:</span><br><span class="line"> idx_row_set = [idx_row - <span class="number">1</span>, idx_row]</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> idx_row_set = [idx_row - <span class="number">1</span>, idx_row, idx_row + <span class="number">1</span>]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> idx_col == <span class="number">0</span>:</span><br><span class="line"> idx_col_set = [idx_col, idx_col + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">elif</span> idx_col == col<span class="number">-1</span>:</span><br><span class="line"> idx_col_set = [idx_col - <span class="number">1</span>, idx_col]</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> idx_col_set = [idx_col - <span class="number">1</span>, idx_col, idx_col + <span class="number">1</span>]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> mine_row <span class="keyword">in</span> idx_row_set:</span><br><span class="line"> <span class="keyword">for</span> mine_col <span class="keyword">in</span> idx_col_set:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((mine_row == idx_row) <span class="keyword">and</span> (mine_col == idx_col)):</span><br><span class="line"> <span class="keyword">if</span> matrix[mine_row][mine_col]:</span><br><span class="line"> MineCounter = MineCounter + <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> MineCounterMat[idx_row][idx_col] = MineCounter</span><br><span class="line"> <span class="keyword">return</span> MineCounterMat</span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Test case</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line">matrix = [[<span class="literal">True</span>, <span class="literal">False</span>, <span class="literal">False</span>],</span><br><span class="line"> [<span class="literal">False</span>, <span class="literal">True</span>, <span class="literal">False</span>],</span><br><span class="line"> [<span class="literal">False</span>, <span class="literal">False</span>, <span class="literal">False</span>]]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 알고리즘 생각해보기</span></span><br><span class="line"><span class="comment"># 자기 자신의 값을 제외하고, 현재 인덱스의 지뢰 개수는 현재 위치 값의 주위에 있는 true 값의 개수</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 행의 갯수</span></span><br><span class="line">row = len(matrix)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 열의 갯수</span></span><br><span class="line">col = len(matrix[<span class="number">0</span>])</span><br><span class="line"></span><br><span class="line"><span class="comment"># 지뢰 개수를 담을 매트릭스</span></span><br><span class="line">MineCounterMat = np.zeros((row, col))</span><br><span class="line"></span><br><span class="line"><span class="comment"># 매트릭스 확인</span></span><br><span class="line">print(matrix)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 행, 열 개수 확인</span></span><br><span class="line">print(row)</span><br><span class="line">print(col)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 전체 매트릭스의 인덱스에 대해 반복</span></span><br><span class="line"><span class="keyword">for</span> idx_row <span class="keyword">in</span> range(row):</span><br><span class="line"> <span class="keyword">for</span> idx_col <span class="keyword">in</span> range(col): </span><br><span class="line"></span><br><span class="line"> <span class="comment"># 주위의 지뢰 갯수 찾기</span></span><br><span class="line"> MineCounter = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"> <span class="comment"># 매트릭스의 테두리 부분은 주위 개수가 다르기 때문에 인덱스를 지정해주어야함</span></span><br><span class="line"> <span class="comment"># 행 인덱스 지정</span></span><br><span class="line"> <span class="keyword">if</span> idx_row == <span class="number">0</span>:</span><br><span class="line"> idx_row_set = [idx_row, idx_row + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">elif</span> idx_row == row<span class="number">-1</span>:</span><br><span class="line"> idx_row_set = [idx_row - <span class="number">1</span>, idx_row]</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> idx_row_set = [idx_row - <span class="number">1</span>, idx_row, idx_row + <span class="number">1</span>]</span><br><span class="line"></span><br><span class="line"> <span class="comment"># 열 인덱스 지정</span></span><br><span class="line"> <span class="keyword">if</span> idx_col == <span class="number">0</span>:</span><br><span class="line"> idx_col_set = [idx_col, idx_col + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">elif</span> idx_col == col<span class="number">-1</span>:</span><br><span class="line"> idx_col_set = [idx_col - <span class="number">1</span>, idx_col]</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> idx_col_set = [idx_col - <span class="number">1</span>, idx_col, idx_col + <span class="number">1</span>]</span><br><span class="line"></span><br><span class="line"> <span class="comment"># 지정한 인덱스 확인</span></span><br><span class="line"> print(idx_row_set)</span><br><span class="line"> print(idx_col_set)</span><br><span class="line"></span><br><span class="line"> <span class="comment"># 지정한 인덱스에 대해서 반복</span></span><br><span class="line"> <span class="keyword">for</span> mine_row <span class="keyword">in</span> idx_row_set:</span><br><span class="line"> <span class="keyword">for</span> mine_col <span class="keyword">in</span> idx_col_set:</span><br><span class="line"> print(<span class="string">"row: %d, col: %d"</span> % (idx_row, idx_col))</span><br><span class="line"> print(<span class="string">"mine_row: %d, mine_col: %d"</span> % (mine_row, mine_col))</span><br><span class="line"></span><br><span class="line"> <span class="comment"># 자기 자신을 제외한 주위의 값을 확인해서 지뢰 개수 세기</span></span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((mine_row == idx_row) <span class="keyword">and</span> (mine_col == idx_col)):</span><br><span class="line"> <span class="keyword">if</span> matrix[mine_row][mine_col]:</span><br><span class="line"> MineCounter = MineCounter + <span class="number">1</span></span><br><span class="line"> print(<span class="string">"Mine Counter: %d"</span> % (MineCounter))</span><br><span class="line"></span><br><span class="line"> <span class="comment"># 현재 인덱스에 지뢰 개수 넣기</span></span><br><span class="line"> MineCounterMat[idx_row][idx_col] = MineCounter</span><br><span class="line"> print(MineCounterMat)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/10/pythoncodefight-day19/" data-id="ck6f6hy720000y0482n058kfr" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day18" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/08/pythoncodefight-day18/" class="article-date">
<time datetime="2020-02-08T14:56:43.000Z" itemprop="datePublished">2020-02-08</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/08/pythoncodefight-day18/">PythonCodeFight-Day18</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-18"><a href="#Day-18" class="headerlink" title="Day_18"></a>Day_18</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q24-Mindsweeper"><a href="#Q24-Mindsweeper" class="headerlink" title="Q24. Mindsweeper"></a>Q24. Mindsweeper</h2><p>In the popular Minesweeper game you have a board with some mines and those cells that don’t contain a mine have a number in it that indicates the total number of mines in the neighboring cells. Starting off with some arrangement of mines we want to create a Minesweeper game setup.</p>
<p>알고리즘 고민, 및 러프한 코드 작성 중!</p>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Test case</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line">matrix = [[<span class="literal">True</span>, <span class="literal">False</span>, <span class="literal">False</span>],</span><br><span class="line"> [<span class="literal">False</span>, <span class="literal">True</span>, <span class="literal">False</span>],</span><br><span class="line"> [<span class="literal">False</span>, <span class="literal">False</span>, <span class="literal">False</span>]]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 알고리즘 생각해보기</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 만약 현재 값이 true인 경우, 현재 인덱스의 값은 1</span></span><br><span class="line"><span class="comment"># 만약 현재 값이 false인 경우, 현재 인덱스의 값은 현재 위치 값의 주위에 true 개수</span></span><br><span class="line"></span><br><span class="line">row = len(matrix)</span><br><span class="line">col = len(matrix[<span class="number">0</span>])</span><br><span class="line"></span><br><span class="line">MineCounterMat = np.zeros((row, col))</span><br><span class="line"></span><br><span class="line">print(row)</span><br><span class="line">print(col)</span><br><span class="line"></span><br><span class="line"><span class="keyword">for</span> idx_row <span class="keyword">in</span> range(row):</span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> idx_col <span class="keyword">in</span> range(col): </span><br><span class="line"></span><br><span class="line"> MineCounter = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"> CurrVal = matrix[idx_row][idx_col]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> idx_row == <span class="number">0</span>:</span><br><span class="line"> idx_row_set = [idx_row, idx_row + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">if</span> idx_row == row:</span><br><span class="line"> idx_row_set = [idx_row - <span class="number">1</span>, idx_row]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> idx_col == <span class="number">0</span>:</span><br><span class="line"> idx_col_set = [idx_col, idx_col + <span class="number">1</span>]</span><br><span class="line"> <span class="keyword">if</span> idx_col == col:</span><br><span class="line"> idx_col_set = [idx_col - <span class="number">1</span>, idx_col]</span><br><span class="line"></span><br><span class="line"> print(idx_row_set)</span><br><span class="line"> print(idx_col_set)</span><br><span class="line"> <span class="keyword">for</span> mine_row <span class="keyword">in</span> idx_row_set:</span><br><span class="line"> <span class="keyword">for</span> mine_col <span class="keyword">in</span> idx_col_set:</span><br><span class="line"> <span class="keyword">if</span> matrix[mine_row][mine_col]:</span><br><span class="line"> print(mine_row)</span><br><span class="line"> print(mine_col)</span><br><span class="line"> MineCounter = MineCounter + <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> MineCounterMat[idx_row][idx_col] = MineCounter</span><br><span class="line"></span><br><span class="line">print(MineCounterMat)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/08/pythoncodefight-day18/" data-id="ck6f5j4ls00007448hfee7mlo" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day17" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/05/pythoncodefight-day17/" class="article-date">
<time datetime="2020-02-05T14:25:44.000Z" itemprop="datePublished">2020-02-05</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/05/pythoncodefight-day17/">PythonCodeFight-Day17</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-17"><a href="#Day-17" class="headerlink" title="Day_17"></a>Day_17</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q23-Box-Blur"><a href="#Q23-Box-Blur" class="headerlink" title="Q23. Box Blur"></a>Q23. Box Blur</h2><p>Last night you partied a little too hard. Now there’s a black and white photo of you that’s about to go viral! You can’t let this ruin your reputation, so you want to apply the box blur algorithm to the photo to hide its content.</p>
<p>The pixels in the input image are represented as integers. The algorithm distorts the input image in the following way: Every pixel x in the output image has a value equal to the average value of the pixel values from the 3 × 3 square that has its center at x, including x itself. All the pixels on the border of x are then removed.</p>
<p>Return the blurred image as an integer, with the fractions rounded down.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">boxBlur</span><span class="params">(image)</span>:</span></span><br><span class="line"> Row = len(image)</span><br><span class="line"> Col = len(image[<span class="number">0</span>])</span><br><span class="line"></span><br><span class="line"> BlurSumSet = np.zeros((Row<span class="number">-2</span>,Col<span class="number">-2</span>))</span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(<span class="number">1</span>, Row<span class="number">-1</span>, <span class="number">1</span>):</span><br><span class="line"> <span class="keyword">for</span> j <span class="keyword">in</span> range(<span class="number">1</span>, Col<span class="number">-1</span>, <span class="number">1</span>):</span><br><span class="line"> BlurSum = int((image[i<span class="number">-1</span>][j<span class="number">-1</span>] + image[i<span class="number">-1</span>][j] + image[i<span class="number">-1</span>][j+<span class="number">1</span>] + image[i][j<span class="number">-1</span>] + image[i][j] + image[i][j+<span class="number">1</span>] + image[i+<span class="number">1</span>][j<span class="number">-1</span>] + image[i+<span class="number">1</span>][j] + image[i+<span class="number">1</span>][j+<span class="number">1</span>])/<span class="number">9</span>)</span><br><span class="line"> BlurSumSet[i<span class="number">-1</span>][j<span class="number">-1</span>] = BlurSum</span><br><span class="line"></span><br><span class="line"> <span class="keyword">return</span> BlurSumSet</span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">import</span> numpy <span class="keyword">as</span> np</span><br><span class="line"></span><br><span class="line"><span class="comment"># test case</span></span><br><span class="line">image = [[<span class="number">7</span>, <span class="number">4</span>, <span class="number">0</span>, <span class="number">1</span>], </span><br><span class="line"> [<span class="number">5</span>, <span class="number">6</span>, <span class="number">2</span>, <span class="number">2</span>], </span><br><span class="line"> [<span class="number">6</span>, <span class="number">10</span>, <span class="number">7</span>, <span class="number">8</span>], </span><br><span class="line"> [<span class="number">1</span>, <span class="number">4</span>, <span class="number">2</span>, <span class="number">0</span>]]</span><br><span class="line"></span><br><span class="line">print(<span class="string">"Row: %d"</span> % (len(image)))</span><br><span class="line">print(<span class="string">"Col: %d"</span> % (len(image[<span class="number">0</span>])))</span><br><span class="line"></span><br><span class="line"><span class="comment"># 행, 열 사이즈 찾기</span></span><br><span class="line">Row = len(image)</span><br><span class="line">Col = len(image[<span class="number">0</span>])</span><br><span class="line"></span><br><span class="line"><span class="comment"># 3x3이면 양쪽 위아래 1개씩 값을 빼야하므로, 각 행, 열 사이즈에서 2씩 뺀 빈 배열 선언</span></span><br><span class="line">BlurSumSet = np.zeros((Row<span class="number">-2</span>,Col<span class="number">-2</span>))</span><br><span class="line"></span><br><span class="line"><span class="keyword">for</span> i <span class="keyword">in</span> range(<span class="number">1</span>, Row<span class="number">-1</span>, <span class="number">1</span>):</span><br><span class="line"> <span class="keyword">for</span> j <span class="keyword">in</span> range(<span class="number">1</span>, Col<span class="number">-1</span>, <span class="number">1</span>):</span><br><span class="line"> print(<span class="string">"Row: %d, Col: %d"</span> % (i, j)) <span class="comment"># center point 찾기</span></span><br><span class="line"> <span class="comment"># BlurSum 찾기</span></span><br><span class="line"> BlurSum = int((image[i<span class="number">-1</span>][j<span class="number">-1</span>] + image[i<span class="number">-1</span>][j] + image[i<span class="number">-1</span>][j+<span class="number">1</span>] + image[i][j<span class="number">-1</span>] + image[i][j] + image[i][j+<span class="number">1</span>] + image[i+<span class="number">1</span>][j<span class="number">-1</span>] + image[i+<span class="number">1</span>][j] + image[i+<span class="number">1</span>][j+<span class="number">1</span>])/<span class="number">9</span>)</span><br><span class="line"> <span class="comment"># set에 넣기</span></span><br><span class="line"> BlurSumSet[i<span class="number">-1</span>][j<span class="number">-1</span>] = BlurSum</span><br><span class="line"> print(BlurSum)</span><br><span class="line">print(BlurSumSet)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/05/pythoncodefight-day17/" data-id="ck69ep0mc0000pk486afb14kn" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day16" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/04/pythoncodefight-day16/" class="article-date">
<time datetime="2020-02-04T14:00:43.000Z" itemprop="datePublished">2020-02-04</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/04/pythoncodefight-day16/">PythonCodeFight-Day16</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-16"><a href="#Day-16" class="headerlink" title="Day_16"></a>Day_16</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q22-avoidObstacles"><a href="#Q22-avoidObstacles" class="headerlink" title="Q22. avoidObstacles"></a>Q22. avoidObstacles</h2><p>You are given an array of integers representing coordinates of obstacles situated on a straight line.<br>Assume that you are jumping from the point with coordinate 0 to the right. You are allowed only to make jumps of the same length represented by some integer.<br>Find the minimal length of the jump enough to avoid all the obstacles.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">avoidObstacles</span><span class="params">(inputArray)</span>:</span></span><br><span class="line"> inputSort = sorted(inputArray)</span><br><span class="line"></span><br><span class="line"> StepLength = <span class="number">1</span></span><br><span class="line"> ArrIdx = <span class="number">0</span></span><br><span class="line"> CurrStep = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"> <span class="keyword">while</span> <span class="number">1</span>:</span><br><span class="line"> </span><br><span class="line"> CurrObs = inputSort[ArrIdx]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> CurrObs == CurrStep:</span><br><span class="line"> ArrIdx = <span class="number">0</span></span><br><span class="line"> StepLength = StepLength + <span class="number">1</span></span><br><span class="line"> CurrStep = <span class="number">0</span></span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> <span class="keyword">elif</span> CurrObs < CurrStep:</span><br><span class="line"> ArrIdx = ArrIdx + <span class="number">1</span></span><br><span class="line"> <span class="keyword">if</span> ArrIdx == len(inputSort):</span><br><span class="line"> <span class="keyword">break</span> </span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> CurrStep = CurrStep + StepLength</span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> </span><br><span class="line"> <span class="keyword">return</span> StepLength</span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Test case</span></span><br><span class="line">inputArray = [<span class="number">1</span>, <span class="number">4</span>, <span class="number">10</span>, <span class="number">6</span>, <span class="number">2</span>]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 값을 정렬</span></span><br><span class="line">inputSort = sorted(inputArray)</span><br><span class="line">print(inputSort)</span><br><span class="line"></span><br><span class="line">StepLength = <span class="number">1</span></span><br><span class="line">ArrIdx = <span class="number">0</span></span><br><span class="line">CurrStep = <span class="number">0</span></span><br><span class="line">NoPassFlag = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">while</span> <span class="number">1</span>:</span><br><span class="line"> print(<span class="string">'Current Step Length: %d'</span> % (StepLength))</span><br><span class="line"> </span><br><span class="line"> CurrObs = inputSort[ArrIdx]</span><br><span class="line"> print(<span class="string">'Current obstacle: %d'</span> % (CurrObs))</span><br><span class="line"> print(<span class="string">'Current step: %d'</span> % (CurrStep))</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> CurrObs == CurrStep:</span><br><span class="line"> print(<span class="string">"Can't pass current obstacles"</span>)</span><br><span class="line"> ArrIdx = <span class="number">0</span></span><br><span class="line"> StepLength = StepLength + <span class="number">1</span></span><br><span class="line"> CurrStep = <span class="number">0</span></span><br><span class="line"> print(<span class="string">"Add step length"</span>)</span><br><span class="line"> print(<span class="string">" "</span>)</span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> <span class="keyword">elif</span> CurrObs < CurrStep:</span><br><span class="line"> print(<span class="string">"Add obstacle index"</span>)</span><br><span class="line"> ArrIdx = ArrIdx + <span class="number">1</span></span><br><span class="line"> <span class="keyword">if</span> ArrIdx == len(inputSort):</span><br><span class="line"> <span class="keyword">break</span> </span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> print(<span class="string">"Add step length to current step "</span>)</span><br><span class="line"> CurrStep = CurrStep + StepLength</span><br><span class="line"> <span class="keyword">continue</span></span><br><span class="line"> </span><br><span class="line">print(<span class="string">"Break Step Length: %d"</span> % (StepLength))</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/04/pythoncodefight-day16/" data-id="ck69dqxvx0000rk48a0dg98kt" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day15" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/03/pythoncodefight-day15/" class="article-date">
<time datetime="2020-02-03T10:18:25.000Z" itemprop="datePublished">2020-02-03</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/03/pythoncodefight-day15/">PythonCodeFight-Day15</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-15"><a href="#Day-15" class="headerlink" title="Day_15"></a>Day_15</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q22-avoidObstacles"><a href="#Q22-avoidObstacles" class="headerlink" title="Q22. avoidObstacles"></a>Q22. avoidObstacles</h2><p>You are given an array of integers representing coordinates of obstacles situated on a straight line.<br>Assume that you are jumping from the point with coordinate 0 to the right. You are allowed only to make jumps of the same length represented by some integer.<br>Find the minimal length of the jump enough to avoid all the obstacles.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">from</span> math <span class="keyword">import</span> gcd</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">solution</span><span class="params">(arr)</span>:</span></span><br><span class="line"> <span class="function"><span class="keyword">def</span> <span class="title">lcm</span><span class="params">(x,y)</span>:</span></span><br><span class="line"> <span class="keyword">return</span> x*y // gcd(x,y)</span><br><span class="line"></span><br><span class="line"> <span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line"> arr.append(lcm(arr.pop(),arr.pop()))</span><br><span class="line"> <span class="keyword">if</span> len(arr) == <span class="number">1</span>:</span><br><span class="line"> <span class="keyword">return</span> arr[<span class="number">0</span>]</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">avoidObstacles</span><span class="params">(inputArray)</span>:</span></span><br><span class="line"> inputArray = [<span class="number">5</span>, <span class="number">3</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">9</span>]</span><br><span class="line"></span><br><span class="line"> inputSort = sorted(inputArray)</span><br><span class="line"></span><br><span class="line"> DiffNum = []</span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputSort)<span class="number">-1</span>):</span><br><span class="line"> <span class="keyword">if</span> inputSort[i] + <span class="number">1</span> != inputSort[i+<span class="number">1</span>]:</span><br><span class="line"> DiffNum.append(inputSort[i] + <span class="number">1</span>)</span><br><span class="line"> </span><br><span class="line"> DiffDiffNum = []</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(DiffNum)):</span><br><span class="line"> <span class="keyword">if</span> i == <span class="number">0</span>:</span><br><span class="line"> DiffDiffNum.append(DiffNum[i])</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> DiffDiffNum.append(DiffNum[i] - DiffNum[i<span class="number">-1</span>])</span><br><span class="line"></span><br><span class="line"> MinLen = solution(DiffDiffNum)</span><br><span class="line"></span><br><span class="line"> <span class="keyword">return</span> MinLen</span><br></pre></td></tr></table></figure>
<p>제출 결과</p>
<p>2/12 tests passed.</p>
<p>Click the “Run Tests” button to see output, console logs, and detailed error messages for sample or custom test cases. This information is hidden when clicking the “Submit” button in order to prevent hard-coding solutions to the hidden test cases.</p>
<p>Sample tests: 2/6</p>
<p>Hidden tests: 0/6</p>
<p>Score: 33/300</p>
<p>각 값의 차이를 구하고, 그 차이 값의 최소공배수를 구해서 넘어가는 방식으로 코드 작성을 해봤는데, 아예 틀린 방법이었나보다.</p>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br></pre></td><td class="code"><pre><span class="line"></span><br><span class="line"><span class="keyword">from</span> math <span class="keyword">import</span> gcd</span><br><span class="line"></span><br><span class="line"><span class="comment"># inputArray = [5, 3, 6, 7, 9]</span></span><br><span class="line">inputArray = [<span class="number">1</span>, <span class="number">4</span>, <span class="number">10</span>, <span class="number">6</span>, <span class="number">2</span>]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 값을 정렬</span></span><br><span class="line">inputSort = sorted(inputArray)</span><br><span class="line"></span><br><span class="line">DiffNum = []</span><br><span class="line"></span><br><span class="line"><span class="comment"># 비어있는 부분 찾기</span></span><br><span class="line"><span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputSort)<span class="number">-1</span>):</span><br><span class="line"> <span class="keyword">if</span> inputSort[i] + <span class="number">1</span> != inputSort[i+<span class="number">1</span>]:</span><br><span class="line"> DiffNum.append(inputSort[i] + <span class="number">1</span>)</span><br><span class="line"> </span><br><span class="line"></span><br><span class="line">print(inputSort)</span><br><span class="line">print(DiffNum)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 비어있는 부분의 간격 계산</span></span><br><span class="line">DiffDiffNum = []</span><br><span class="line"><span class="keyword">for</span> i <span class="keyword">in</span> range(len(DiffNum)):</span><br><span class="line"> <span class="keyword">if</span> i == <span class="number">0</span>:</span><br><span class="line"> DiffDiffNum.append(DiffNum[i])</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> DiffDiffNum.append(DiffNum[i] - DiffNum[i<span class="number">-1</span>])</span><br><span class="line"></span><br><span class="line">print(DiffDiffNum)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 간격들의 최소공배수 구하기</span></span><br><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">solution</span><span class="params">(arr)</span>:</span></span><br><span class="line"> <span class="function"><span class="keyword">def</span> <span class="title">lcm</span><span class="params">(x,y)</span>:</span></span><br><span class="line"> <span class="keyword">return</span> x*y // gcd(x,y)</span><br><span class="line"></span><br><span class="line"> <span class="keyword">while</span> <span class="literal">True</span>:</span><br><span class="line"> arr.append(lcm(arr.pop(),arr.pop()))</span><br><span class="line"> <span class="keyword">if</span> len(arr) == <span class="number">1</span>:</span><br><span class="line"> <span class="keyword">return</span> arr[<span class="number">0</span>]</span><br><span class="line"></span><br><span class="line">MinLen = solution(DiffDiffNum)</span><br><span class="line"></span><br><span class="line">print(MinLen)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/03/pythoncodefight-day15/" data-id="ck695tad70000f8481ae1d3gk" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day14" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/02/01/pythoncodefight-day14/" class="article-date">
<time datetime="2020-02-01T01:27:24.000Z" itemprop="datePublished">2020-02-01</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/02/01/pythoncodefight-day14/">PythonCodeFight-Day14</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-14"><a href="#Day-14" class="headerlink" title="Day_14"></a>Day_14</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q21-isIPv4Address"><a href="#Q21-isIPv4Address" class="headerlink" title="Q21. isIPv4Address"></a>Q21. isIPv4Address</h2><p>An IP address is a numerical label assigned to each device (e.g., computer, printer) participating in a computer network that uses the Internet Protocol for communication. There are two versions of the Internet protocol, and thus two versions of addresses. One of them is the IPv4 address.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">isIPv4Address</span><span class="params">(inputString)</span>:</span></span><br><span class="line"> inputDivide = inputString.split(<span class="string">'.'</span>)</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> len(inputDivide) != <span class="number">4</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputDivide)):</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> inputDivide[i]:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((int(inputDivide[i]) >= <span class="number">0</span>) <span class="keyword">and</span> (int(inputDivide[i]) <= <span class="number">255</span>)):</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">except</span>: </span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">return</span> <span class="literal">True</span></span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Case</span></span><br><span class="line"><span class="comment"># inputString = "172.16.254.1"</span></span><br><span class="line"><span class="comment"># inputString = ".254.255.0"</span></span><br><span class="line"><span class="comment"># inputString = "1.23.256.255."</span></span><br><span class="line">inputString = <span class="string">"0.254.255.0"</span></span><br><span class="line"><span class="comment"># inputString = "1.1.1.1a"</span></span><br><span class="line"></span><br><span class="line">print(len(inputString))</span><br><span class="line">print(inputString)</span><br><span class="line">inputDivide = inputString.split(<span class="string">'.'</span>) <span class="comment"># '.'을 기준으로 문자열 분리</span></span><br><span class="line">print(inputDivide)</span><br><span class="line"></span><br><span class="line"><span class="comment"># Test 1 </span></span><br><span class="line"><span class="comment"># inputString = "1.1.1.1a" 의 케이스에서 에러가 났음</span></span><br><span class="line"><span class="comment"># 1a를 int로 처리하는 경우 에러가 발생!</span></span><br><span class="line"><span class="keyword">if</span> len(inputDivide) != <span class="number">4</span>: <span class="comment"># split을 하는 경우, '.' 가 3개가 아니면 ip가 아니기 때문에 갯수 제약 조건을 넣어줬음</span></span><br><span class="line"> print(<span class="string">"False, Not 4 values"</span>)</span><br><span class="line"><span class="keyword">else</span>: <span class="comment"># 갯수가 맞는 경우</span></span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputDivide)): <span class="comment"># 각 항몫을 판단</span></span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> inputDivide[i]: <span class="comment"># 값이 없는 경우</span></span><br><span class="line"> print(<span class="string">"False, Empty string"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> int(inputDivide[i]): </span><br><span class="line"> print(<span class="string">"False, Not number"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((int(inputDivide[i]) >= <span class="number">0</span>) <span class="keyword">and</span> (int(inputDivide[i]) <= <span class="number">255</span>)): <span class="comment"># 값이 숫자 범위 내에 있지 않은 경우</span></span><br><span class="line"> print(<span class="string">"False, Not in range"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> print(<span class="string">"True"</span>)</span><br><span class="line"></span><br><span class="line"><span class="comment"># Test 2</span></span><br><span class="line"><span class="comment"># 0인 경우 False 값을 리턴하는 에러가 생겼음</span></span><br><span class="line"><span class="keyword">if</span> len(inputDivide) != <span class="number">4</span>:</span><br><span class="line"> print(<span class="string">"False, Not 4 values"</span>)</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputDivide)):</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> int(inputDivide[i])): <span class="comment"># 이렇게 하니까 0인 경우 False가 나옴</span></span><br><span class="line"> print(<span class="string">"False, Not number"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((int(inputDivide[i]) >= <span class="number">0</span>) <span class="keyword">and</span> (int(inputDivide[i]) <= <span class="number">255</span>)):</span><br><span class="line"> print(<span class="string">"False, Not in range"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> print(<span class="string">"True"</span>)</span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"False, Not number"</span>) </span><br><span class="line"></span><br><span class="line"><span class="comment"># Test 3</span></span><br><span class="line"><span class="comment"># 최종 제출 코드</span></span><br><span class="line"><span class="keyword">if</span> len(inputDivide) != <span class="number">4</span>:</span><br><span class="line"> print(<span class="string">"False, Not 4 values"</span>)</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputDivide)):</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> inputDivide[i]:</span><br><span class="line"> print(<span class="string">"False, Empty string"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> ((int(inputDivide[i]) >= <span class="number">0</span>) <span class="keyword">and</span> (int(inputDivide[i]) <= <span class="number">255</span>)):</span><br><span class="line"> print(<span class="string">"False, Not in range"</span>)</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> print(<span class="string">"True"</span>)</span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"False, Not number"</span>)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/02/01/pythoncodefight-day14/" data-id="ck62x30o500006o485ohdcbgh" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day13" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/01/27/pythoncodefight-day13/" class="article-date">
<time datetime="2020-01-27T14:45:27.000Z" itemprop="datePublished">2020-01-27</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/01/27/pythoncodefight-day13/">PythonCodeFight-Day13</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-13"><a href="#Day-13" class="headerlink" title="Day_13"></a>Day_13</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q21-isIPv4Address"><a href="#Q21-isIPv4Address" class="headerlink" title="Q21. isIPv4Address"></a>Q21. isIPv4Address</h2><p>An IP address is a numerical label assigned to each device (e.g., computer, printer) participating in a computer network that uses the Internet Protocol for communication. There are two versions of the Internet protocol, and thus two versions of addresses. One of them is the IPv4 address.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">isIPv4Address</span><span class="params">(inputString)</span>:</span></span><br><span class="line"> dotidxlist = []</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">if</span> len(inputString) >= <span class="number">15</span> <span class="keyword">or</span> len(inputString) < <span class="number">8</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputString)):</span><br><span class="line"> <span class="keyword">if</span> inputString[i] == <span class="string">"."</span>:</span><br><span class="line"> dotidxlist.append(i)</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> len(dotidxlist) != <span class="number">3</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(dotidxlist)):</span><br><span class="line"> <span class="keyword">if</span> i == <span class="number">0</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp = int(inputString[<span class="number">0</span>:dotidxlist[i]])</span><br><span class="line"> <span class="keyword">if</span> Temp < <span class="number">0</span> <span class="keyword">or</span> Temp > <span class="number">255</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">elif</span> i == len(dotidxlist)<span class="number">-1</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp1 = int(inputString[dotidxlist[i<span class="number">-1</span>]+<span class="number">1</span>:dotidxlist[i]])</span><br><span class="line"> <span class="keyword">if</span> Temp1 < <span class="number">0</span> <span class="keyword">or</span> Temp1 > <span class="number">255</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp2 = int(inputString[dotidxlist[i]+<span class="number">1</span>:])</span><br><span class="line"> <span class="keyword">if</span> Temp2 < <span class="number">0</span> <span class="keyword">or</span> Temp2 > <span class="number">255</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp = int(inputString[dotidxlist[i<span class="number">-1</span>]+<span class="number">1</span>:dotidxlist[i]])</span><br><span class="line"> <span class="keyword">if</span> Temp < <span class="number">0</span> <span class="keyword">or</span> Temp > <span class="number">255</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">return</span> <span class="literal">True</span></span><br></pre></td></tr></table></figure>
<p>현재 결과 <br>33/35 tests passed. <br>Sample tests: 18/18 <br>Hidden tests: 15/17 <br>Score: 276/300 </p>
<ul>
<li>2개의 히든케이스를 만족하지 못했음 => 연산시간적인 문제 혹은 다른 문제 때문에 발생했다고 판단됨</li>
</ul>
<p>해결 방안</p>
<ul>
<li>파이썬에서 제공하는 string 관련 기본적인 메소드 들을 이용해서 다시 한 번 작성하기<ul>
<li>string의 경우 내장함수 <strong>split</strong> 을 이용하면 원하는 키워드를 기준으로 string 문자열을 분리해낼 수 있음</li>
</ul>
</li>
</ul>
<hr>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Case</span></span><br><span class="line"><span class="comment"># inputString = "172.16.254.1"</span></span><br><span class="line">inputString = <span class="string">".254.255.0"</span></span><br><span class="line"></span><br><span class="line">print(len(inputString))</span><br><span class="line"></span><br><span class="line">dotidxlist = []</span><br><span class="line"><span class="keyword">if</span> len(inputString) >= <span class="number">15</span>:</span><br><span class="line"> print(<span class="string">"False"</span>)</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputString)):</span><br><span class="line"> <span class="keyword">if</span> inputString[i] == <span class="string">"."</span>:</span><br><span class="line"> dotidxlist.append(i)</span><br><span class="line"> print(<span class="string">'idx = %d '</span>%(i))</span><br><span class="line"> print(<span class="string">"True"</span>)</span><br><span class="line"> print(dotidxlist)</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(dotidxlist)):</span><br><span class="line"> <span class="keyword">if</span> i == <span class="number">0</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp = int(inputString[<span class="number">0</span>:dotidxlist[i]])</span><br><span class="line"> print(Temp)</span><br><span class="line"> <span class="keyword">if</span> Temp < <span class="number">0</span> <span class="keyword">or</span> Temp > <span class="number">255</span>:</span><br><span class="line"> print(<span class="string">"False"</span>)</span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"Empty False"</span>)</span><br><span class="line"> <span class="comment"># print(i)</span></span><br><span class="line"> <span class="keyword">elif</span> i == len(dotidxlist)<span class="number">-1</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp1 = int(inputString[dotidxlist[i<span class="number">-1</span>]+<span class="number">1</span>:dotidxlist[i]])</span><br><span class="line"> print(Temp1)</span><br><span class="line"> <span class="keyword">if</span> Temp1 < <span class="number">0</span> <span class="keyword">or</span> Temp1 > <span class="number">255</span>:</span><br><span class="line"> print(<span class="string">"False"</span>)</span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"Empty False"</span>)</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp2 = int(inputString[dotidxlist[i]+<span class="number">1</span>:])</span><br><span class="line"> print(Temp2)</span><br><span class="line"> <span class="keyword">if</span> Temp2 < <span class="number">0</span> <span class="keyword">or</span> Temp2 > <span class="number">255</span>:</span><br><span class="line"> print(<span class="string">"False"</span>) </span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"Empty False"</span>)</span><br><span class="line"> <span class="comment"># print(i)</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">try</span>:</span><br><span class="line"> Temp = int(inputString[dotidxlist[i<span class="number">-1</span>]+<span class="number">1</span>:dotidxlist[i]])</span><br><span class="line"> print(Temp)</span><br><span class="line"> <span class="keyword">if</span> Temp < <span class="number">0</span> <span class="keyword">or</span> Temp > <span class="number">255</span>:</span><br><span class="line"> print(<span class="string">"False"</span>) </span><br><span class="line"> <span class="keyword">except</span>:</span><br><span class="line"> print(<span class="string">"Empty False"</span>)</span><br><span class="line"> <span class="comment"># print(i)</span></span><br><span class="line"> print(<span class="string">"True"</span>)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/01/27/pythoncodefight-day13/" data-id="ck5wkdpuo0000co481thvdf3a" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day12" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/01/25/pythoncodefight-day12/" class="article-date">
<time datetime="2020-01-24T17:15:18.000Z" itemprop="datePublished">2020-01-25</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/01/25/pythoncodefight-day12/">PythonCodeFight-Day12</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-12"><a href="#Day-12" class="headerlink" title="Day_12"></a>Day_12</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q19-areEquallyStrong"><a href="#Q19-areEquallyStrong" class="headerlink" title="Q19. areEquallyStrong"></a>Q19. areEquallyStrong</h2><p>Call two arms equally strong if the heaviest weights they each are able to lift are equal.</p>
<p>Call two people equally strong if their strongest arms are equally strong (the strongest arm can be both the right and the left), and so are their weakest arms.</p>
<p>Given your and your friend’s arms’ lifting capabilities find out if you two are equally strong.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">areEquallyStrong</span><span class="params">(yourLeft, yourRight, friendsLeft, friendsRight)</span>:</span></span><br><span class="line"> <span class="keyword">if</span> yourLeft >= yourRight:</span><br><span class="line"> yourStrong = yourLeft</span><br><span class="line"> yourWeak = yourRight</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> yourStrong = yourRight</span><br><span class="line"> yourWeak = yourLeft</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> friendsLeft >= friendsRight:</span><br><span class="line"> friendsStrong = friendsLeft</span><br><span class="line"> friendsWeak = friendsRight</span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> friendsStrong = friendsRight</span><br><span class="line"> friendsWeak = friendsLeft</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> (yourStrong == friendsStrong) <span class="keyword">and</span> (yourWeak == friendsWeak):</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Case: true</span></span><br><span class="line"><span class="comment"># yourLeft = 10</span></span><br><span class="line"><span class="comment"># yourRight = 15</span></span><br><span class="line"><span class="comment"># friendsLeft = 15</span></span><br><span class="line"><span class="comment"># friendsRight = 10</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># Case: false</span></span><br><span class="line">yourLeft = <span class="number">15</span></span><br><span class="line">yourRight = <span class="number">10</span></span><br><span class="line">friendsLeft = <span class="number">15</span></span><br><span class="line">friendsRight = <span class="number">9</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 맨 처음엔 둘의 합을 가지고 계산하는 조건을 넣으려고 했으나, 생각해보니 강한 팔과 약한 팔의 값이 같으면 합은 당연히 같은 거라서 따로 조건을 넣어줄 필요가 업성서 뺐음</span></span><br><span class="line"><span class="comment"># yourWeight = yourLeft + yourRight</span></span><br><span class="line"><span class="comment"># friendsWeight = friendsLeft + friendsRight</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 나의 강한 팔 값 찾기</span></span><br><span class="line"><span class="keyword">if</span> yourLeft >= yourRight:</span><br><span class="line"> yourStrong = yourLeft</span><br><span class="line"> yourWeak = yourRight</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> yourStrong = yourRight</span><br><span class="line"> yourWeak = yourLeft</span><br><span class="line"></span><br><span class="line"><span class="comment"># 친구의 강한 팔 값 찾기</span></span><br><span class="line"><span class="keyword">if</span> friendsLeft >= friendsRight:</span><br><span class="line"> friendsStrong = friendsLeft</span><br><span class="line"> friendsWeak = friendsRight</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> friendsStrong = friendsRight</span><br><span class="line"> friendsWeak = friendsLeft</span><br><span class="line"></span><br><span class="line"><span class="comment"># 비교해서 값 리턴하기</span></span><br><span class="line"><span class="keyword">if</span> (yourStrong == friendsStrong) <span class="keyword">and</span> (yourWeak == friendsWeak):</span><br><span class="line"> print(<span class="string">"true"</span>)</span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> print(<span class="string">"false"</span>)</span><br><span class="line"></span><br><span class="line"><span class="comment"># if yourWeight == friendsWeight:</span></span><br><span class="line"><span class="comment"># print("True")</span></span><br><span class="line"><span class="comment"># else:</span></span><br><span class="line"><span class="comment"># print("False")</span></span><br></pre></td></tr></table></figure>
<hr>
<h2 id="Q20-arrayMaximalAdjacentDifference"><a href="#Q20-arrayMaximalAdjacentDifference" class="headerlink" title="Q20. arrayMaximalAdjacentDifference"></a>Q20. arrayMaximalAdjacentDifference</h2><p>Given an array of integers, find the maximal absolute difference between any two of its adjacent elements. </p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">arrayMaximalAdjacentDifference</span><span class="params">(inputArray)</span>:</span></span><br><span class="line"> difflist = []</span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputArray)<span class="number">-1</span>):</span><br><span class="line"> difflist.append(abs(inputArray[i]-inputArray[i+<span class="number">1</span>]))</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">return</span> max(difflist)</span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Case</span></span><br><span class="line"><span class="comment"># inputArray = [2, 4, 1, 0]</span></span><br><span class="line">inputArray = [<span class="number">-1</span>, <span class="number">4</span>, <span class="number">10</span>, <span class="number">3</span>, <span class="number">-2</span>]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 차이 값을 넣을 리스트 선언</span></span><br><span class="line">difflist = []</span><br><span class="line"></span><br><span class="line"><span class="comment"># 전체 배열 돌면서 차이의 절대값 넣기</span></span><br><span class="line"><span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputArray)<span class="number">-1</span>):</span><br><span class="line"> difflist.append(abs(inputArray[i]-inputArray[i+<span class="number">1</span>]))</span><br><span class="line"></span><br><span class="line">print(max(difflist))</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/01/25/pythoncodefight-day12/" data-id="ck5sfoju60000to48f44p1xf2" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-pythoncodefight-day11" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/01/23/pythoncodefight-day11/" class="article-date">
<time datetime="2020-01-23T02:10:26.000Z" itemprop="datePublished">2020-01-23</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/python/">Python</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/01/23/pythoncodefight-day11/">PythonCodeFight-Day11</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="Day-11"><a href="#Day-11" class="headerlink" title="Day_11"></a>Day_11</h1><h1 id="Intro"><a href="#Intro" class="headerlink" title="Intro"></a>Intro</h1><h2 id="Q17-arrayChange"><a href="#Q17-arrayChange" class="headerlink" title="Q17. arrayChange"></a>Q17. arrayChange</h2><p>You are given an array of integers. On each move you are allowed to increase exactly one of its element by one. Find the minimal number of moves required to obtain a strictly increasing sequence from the input.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">arrayChange</span><span class="params">(inputArray)</span>:</span></span><br><span class="line"> AddNum = <span class="number">0</span></span><br><span class="line"> </span><br><span class="line"> <span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputArray) <span class="number">-1</span>):</span><br><span class="line"> <span class="keyword">if</span> inputArray[i] >= inputArray[i+<span class="number">1</span>]:</span><br><span class="line"> AddNum += inputArray[i] + <span class="number">1</span> - inputArray[i+<span class="number">1</span>]</span><br><span class="line"> inputArray[i+<span class="number">1</span>] = inputArray[i] + <span class="number">1</span></span><br><span class="line"> </span><br><span class="line"> <span class="keyword">return</span> AddNum</span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># 테스트 케이스들</span></span><br><span class="line">inputArray = [<span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>]</span><br><span class="line">inputArray = [<span class="number">3122</span>, <span class="number">-645</span>, <span class="number">2616</span>, <span class="number">13213</span>, <span class="number">-8069</span>]</span><br><span class="line">inputArray = [<span class="number">2</span>, <span class="number">3</span>, <span class="number">3</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">5</span>, <span class="number">4</span>, <span class="number">12</span>, <span class="number">12</span>, <span class="number">10</span>, <span class="number">15</span>]</span><br><span class="line">inputArray = [<span class="number">22121</span>, <span class="number">42080</span>, <span class="number">-51776</span>, <span class="number">-28528</span>, <span class="number">39895</span>, <span class="number">-50842</span>, <span class="number">25463</span>, <span class="number">46187</span>, <span class="number">-29518</span>,</span><br><span class="line"><span class="number">42293</span>, <span class="number">-25615</span>, <span class="number">-47412</span>, <span class="number">24945</span>, <span class="number">-2630</span>, <span class="number">-12717</span>, <span class="number">-23773</span>, <span class="number">-47824</span>, <span class="number">-7768</span>, <span class="number">-23620</span>,</span><br><span class="line"><span class="number">-30270</span>, <span class="number">-51644</span>, <span class="number">42829</span>, <span class="number">27609</span>, <span class="number">-40734</span>, <span class="number">2142</span>, <span class="number">20285</span>, <span class="number">29665</span>, <span class="number">-36557</span>, <span class="number">-24074</span>,</span><br><span class="line"><span class="number">-11996</span>, <span class="number">30511</span>, <span class="number">17104</span>, <span class="number">4360</span>, <span class="number">-41163</span>, <span class="number">6814</span>, <span class="number">959</span>, <span class="number">26613</span>, <span class="number">-15121</span>, <span class="number">-17355</span>,</span><br><span class="line"><span class="number">28424</span>, <span class="number">-11305</span>, <span class="number">33175</span>, <span class="number">-8585</span>, <span class="number">23649</span>, <span class="number">-18428</span>, <span class="number">16770</span>, <span class="number">14095</span>, <span class="number">38766</span>, <span class="number">-22425</span>,</span><br><span class="line"><span class="number">-45139</span>, <span class="number">-5836</span>, <span class="number">-28668</span>, <span class="number">-15123</span>, <span class="number">-35450</span>, <span class="number">41353</span>, <span class="number">11103</span>, <span class="number">-29233</span>, <span class="number">-51990</span>, <span class="number">-14958</span>,</span><br><span class="line"><span class="number">45944</span>, <span class="number">20841</span>, <span class="number">-34149</span>, <span class="number">34720</span>, <span class="number">-51760</span>, <span class="number">23519</span>, <span class="number">-46257</span>, <span class="number">40985</span>, <span class="number">-32615</span>, <span class="number">-43378</span>,</span><br><span class="line"><span class="number">14243</span>, <span class="number">-24731</span>, <span class="number">1311</span>, <span class="number">-4236</span>, <span class="number">-24885</span>, <span class="number">41713</span>, <span class="number">-45195</span>, <span class="number">-14683</span>, <span class="number">47765</span>, <span class="number">26904</span>,</span><br><span class="line"><span class="number">-51741</span>, <span class="number">38051</span>, <span class="number">13429</span>, <span class="number">38189</span>, <span class="number">-45812</span>, <span class="number">-52474</span>, <span class="number">14936</span>, <span class="number">6582</span>, <span class="number">-26313</span>, <span class="number">4692</span>,</span><br><span class="line"><span class="number">12313</span>, <span class="number">-37502</span>, <span class="number">-40673</span>, <span class="number">5799</span>, <span class="number">23264</span>, <span class="number">33617</span>, <span class="number">-50938</span>, <span class="number">26268</span>, <span class="number">-25548</span>, <span class="number">-22353</span>,</span><br><span class="line"><span class="number">-15175</span>, <span class="number">-21568</span>, <span class="number">18656</span>, <span class="number">19208</span>, <span class="number">20674</span>, <span class="number">41228</span>, <span class="number">-42538</span>, <span class="number">-45085</span>, <span class="number">-32356</span>, <span class="number">-39901</span>,</span><br><span class="line"><span class="number">-39585</span>, <span class="number">-50690</span>, <span class="number">2859</span>, <span class="number">-4079</span>, <span class="number">29823</span>, <span class="number">28849</span>, <span class="number">-2142</span>, <span class="number">-16613</span>, <span class="number">23378</span>, <span class="number">36363</span>,</span><br><span class="line"><span class="number">31780</span>, <span class="number">-40379</span>, <span class="number">7489</span>, <span class="number">-13324</span>, <span class="number">-22377</span>, <span class="number">35661</span>, <span class="number">-27141</span>, <span class="number">-42727</span>, <span class="number">10122</span>, <span class="number">-40385</span>,</span><br><span class="line"><span class="number">-19765</span>, <span class="number">33913</span>, <span class="number">-10504</span>, <span class="number">-4715</span>, <span class="number">-18190</span>, <span class="number">41430</span>, <span class="number">-19134</span>, <span class="number">32646</span>, <span class="number">25839</span>, <span class="number">783</span>, <span class="number">32941</span>, <span class="number">-25142</span>]</span><br><span class="line"></span><br><span class="line"><span class="comment"># 리턴해줄 값을 0으로 초기화</span></span><br><span class="line">AddNum = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 입력받은 행렬의 전체 길이 - 1 만큼 반복한다 (다음 값과 비교해야해서 -1 처리 해주는 것)</span></span><br><span class="line"><span class="keyword">for</span> i <span class="keyword">in</span> range(len(inputArray)<span class="number">-1</span>):</span><br><span class="line"> <span class="comment"># 만약 현재 값이 다음 값보다 큰 경우, </span></span><br><span class="line"> <span class="keyword">if</span> inputArray[i] >= inputArray[i+<span class="number">1</span>]:</span><br><span class="line"> <span class="comment"># 다음 값을 현재 값보다 1 크게 하기 위한 값을 저장한다.</span></span><br><span class="line"> AddNum += inputArray[i] + <span class="number">1</span> - inputArray[i+<span class="number">1</span>]</span><br><span class="line"> <span class="comment"># 확인용 print 코드</span></span><br><span class="line"> print(<span class="string">"Index: {}, Diff: {}, Total: {}"</span>.format(i, inputArray[i] + <span class="number">1</span> - inputArray[i+<span class="number">1</span>], AddNum))</span><br><span class="line"> <span class="comment"># 다음 값을 현재 값보다 1 크게 해준다.</span></span><br><span class="line"> inputArray[i+<span class="number">1</span>] = inputArray[i] + <span class="number">1</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 바뀐 배열의 결과 확인</span></span><br><span class="line">print(inputArray)</span><br><span class="line"><span class="comment"># 출력해줄 값 확인</span></span><br><span class="line">print(AddNum)</span><br></pre></td></tr></table></figure>
<h2 id="Q18-palindromeRearranging"><a href="#Q18-palindromeRearranging" class="headerlink" title="Q18. palindromeRearranging"></a>Q18. palindromeRearranging</h2><p>Given a string, find out if its characters can be rearranged to form a palindrome.</p>
<p>제출 코드</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">def</span> <span class="title">palindromeRearranging</span><span class="params">(inputString)</span>:</span></span><br><span class="line"> setString = list(set(inputString))</span><br><span class="line"></span><br><span class="line"> dict_alphabet = dict()</span><br><span class="line"> </span><br><span class="line"> <span class="comment"># 각 문자별로 갯수 세기</span></span><br><span class="line"> <span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"> dict_alphabet[temp_alphabet] = <span class="number">0</span></span><br><span class="line"> </span><br><span class="line"> <span class="keyword">for</span> i_input <span class="keyword">in</span> range(len(inputString)):</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">if</span> inputString[i_input] == temp_alphabet:</span><br><span class="line"> dict_alphabet[temp_alphabet] += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> <span class="comment"># 짝수인 경우</span></span><br><span class="line"> count_odd = <span class="number">0</span></span><br><span class="line"> <span class="keyword">if</span> (len(inputString) % <span class="number">2</span>) == <span class="number">0</span> : </span><br><span class="line"> </span><br><span class="line"> <span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">if</span> (dict_alphabet[temp_alphabet] % <span class="number">2</span>) != <span class="number">0</span>:</span><br><span class="line"> count_odd += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> count_odd >= <span class="number">1</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">return</span> <span class="literal">True</span></span><br><span class="line"> <span class="comment"># 홀수인 경우</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"> </span><br><span class="line"> <span class="keyword">if</span> (dict_alphabet[temp_alphabet] % <span class="number">2</span>) != <span class="number">0</span>:</span><br><span class="line"> count_odd += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> count_odd >= <span class="number">2</span>:</span><br><span class="line"> <span class="keyword">return</span> <span class="literal">False</span></span><br><span class="line"> <span class="keyword">return</span> <span class="literal">True</span></span><br></pre></td></tr></table></figure>
<p>작성 흐름</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br></pre></td><td class="code"><pre><span class="line">inputString = <span class="string">"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaabc"</span></span><br><span class="line">print(len(inputString))</span><br><span class="line"><span class="comment"># 문자의 길이 확인하기 => 짝수인지 홀수인지</span></span><br><span class="line"><span class="comment"># 짝수인 경우 => 모든 문자가 짝수개여야 한다.</span></span><br><span class="line"><span class="comment"># 홀수인 경우 => 한 문자까지는 홀수개가 가능하다.</span></span><br><span class="line"><span class="comment"># 문자의 종류 확인하기 </span></span><br><span class="line">setString = list(set(inputString))</span><br><span class="line">print(setString)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 알파벳 별로 갯수를 세기 위해서 dictionary 선언</span></span><br><span class="line">dict_alphabet = dict()</span><br><span class="line"></span><br><span class="line"><span class="comment"># 각 문자별로 갯수 세기</span></span><br><span class="line"><span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"> dict_alphabet[temp_alphabet] = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">for</span> i_input <span class="keyword">in</span> range(len(inputString)):</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> inputString[i_input] == temp_alphabet:</span><br><span class="line"> dict_alphabet[temp_alphabet] += <span class="number">1</span></span><br><span class="line"> </span><br><span class="line">print(dict_alphabet)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 홀수 개수인 알파벳 개수 체크</span></span><br><span class="line">count_odd = <span class="number">0</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 짝수인 경우</span></span><br><span class="line"><span class="keyword">if</span> (len(inputString) % <span class="number">2</span>) == <span class="number">0</span> : </span><br><span class="line"> <span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> (dict_alphabet[temp_alphabet] % <span class="number">2</span>) != <span class="number">0</span>:</span><br><span class="line"> count_odd += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> count_odd >= <span class="number">1</span>:</span><br><span class="line"> print(<span class="string">"false"</span>)</span><br><span class="line"> <span class="keyword">break</span></span><br><span class="line"> print(<span class="string">"true"</span>)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 홀수인 경우</span></span><br><span class="line"><span class="keyword">else</span>:</span><br><span class="line"> <span class="keyword">for</span> i_set <span class="keyword">in</span> range(len(setString)):</span><br><span class="line"> temp_alphabet = setString[i_set]</span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> (dict_alphabet[temp_alphabet] % <span class="number">2</span>) != <span class="number">0</span>:</span><br><span class="line"> count_odd += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> <span class="keyword">if</span> count_odd >= <span class="number">2</span>:</span><br><span class="line"> print(<span class="string">"false"</span>)</span><br><span class="line"> <span class="keyword">break</span></span><br><span class="line"> print(<span class="string">"true"</span>)</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/01/23/pythoncodefight-day11/" data-id="ck5rj3jui0000dc485domd6m1" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/python/" rel="tag">Python</a></li></ul>
</footer>
</div>
</article>
<article id="post-c-16-sort2d" class="article article-type-post" itemscope itemprop="blogPost">
<div class="article-meta">
<a href="/2020/01/20/c-16-sort2d/" class="article-date">
<time datetime="2020-01-20T14:06:33.000Z" itemprop="datePublished">2020-01-20</time>
</a>
<div class="article-category">
<a class="article-category-link" href="/categories/01-study/">01_Study</a>►<a class="article-category-link" href="/categories/01-study/c/">C</a>
</div>
</div>
<div class="article-inner">
<header class="article-header">
<h1 itemprop="name">
<a class="article-title" href="/2020/01/20/c-16-sort2d/">[16] 2차원 배열 정렬 (Sort 2D Array)</a>
</h1>
</header>
<div class="article-entry" itemprop="articleBody">
<h1 id="2차원-배열-정렬-sortrows"><a href="#2차원-배열-정렬-sortrows" class="headerlink" title="2차원 배열 정렬 (sortrows)"></a>2차원 배열 정렬 (sortrows)</h1><p>Matlab에서 제공하는 sortrows 함수를 C언어로 구현한 것</p>
<p>참고자료: 코딩도장 - 버블정렬</p>
<hr>
<h2 id="2차원-배열-정렬-기능-설명"><a href="#2차원-배열-정렬-기능-설명" class="headerlink" title="2차원 배열 정렬 기능 설명"></a>2차원 배열 정렬 기능 설명</h2><p>2차원 배열을 받아서, 각 행의 맨 앞의 값의 크기를 기준으로 오름차순으로 정렬한다.</p>
<p>예를 들어보면</p>
<figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">int</span> a[<span class="number">4</span>][<span class="number">3</span>] = {</span><br><span class="line"> {<span class="number">5</span>,<span class="number">3</span>,<span class="number">4</span>,<span class="number">2</span>},</span><br><span class="line"> {<span class="number">4</span>,<span class="number">5</span>,<span class="number">6</span>,<span class="number">3</span>},</span><br><span class="line"> {<span class="number">7</span>,<span class="number">8</span>,<span class="number">9</span>,<span class="number">3</span>},</span><br><span class="line"> {<span class="number">2</span>,<span class="number">4</span>,<span class="number">4</span>,<span class="number">5</span>}</span><br><span class="line">};</span><br></pre></td></tr></table></figure>
<p>위와 같은 배열이 있을 때, 각 행의 맨 앞의 값과 행의 인덱스는 아래와 같다.</p>
<figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">rowVal1 = {{<span class="number">5</span>},{<span class="number">4</span>},{<span class="number">7</span>},{<span class="number">2</span>}};</span><br><span class="line">rowIdx1 = {{<span class="number">0</span>},{<span class="number">1</span>},{<span class="number">2</span>},{<span class="number">3</span>}};</span><br></pre></td></tr></table></figure>
<p>위의 정보를 행의 값에 따라 오름차순으로 정렬하면 아래와 같다.</p>
<figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">rowSortVal1 = {{<span class="number">2</span>},{<span class="number">4</span>},{<span class="number">5</span>},{<span class="number">7</span>}};</span><br><span class="line">rowSortIdx1 = {{<span class="number">3</span>},{<span class="number">1</span>},{<span class="number">0</span>},{<span class="number">2</span>}};</span><br></pre></td></tr></table></figure>
<p>정렬된 행에 맞게 행렬 자체를 정렬하면 아래와 같다.</p>
<figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">int</span> aSort[<span class="number">4</span>][<span class="number">3</span>] = {</span><br><span class="line"> {<span class="number">2</span>,<span class="number">4</span>,<span class="number">4</span>,<span class="number">5</span>},</span><br><span class="line"> {<span class="number">4</span>,<span class="number">5</span>,<span class="number">6</span>,<span class="number">3</span>},</span><br><span class="line"> {<span class="number">5</span>,<span class="number">3</span>,<span class="number">4</span>,<span class="number">2</span>},</span><br><span class="line"> {<span class="number">7</span>,<span class="number">8</span>,<span class="number">9</span>,<span class="number">3</span>}</span><br><span class="line">};</span><br></pre></td></tr></table></figure>
<p>따라서, 각 행의 첫 값을 비교하여 바꿀 인덱스를 확인한 다음, 배열에서 해당 행들의 인덱스를 바꿔주면 된다.</p>
<hr>
<h3 id="C언어로-작성한-코드"><a href="#C언어로-작성한-코드" class="headerlink" title="C언어로 작성한 코드"></a>C언어로 작성한 코드</h3><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><stdio.h></span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><stdlib.h></span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><string.h></span></span></span><br><span class="line"></span><br><span class="line"><span class="comment">// 코딩 도장에서 제공한 기본적인 bubble sort를 내가 필요한 방식으로 수정</span></span><br><span class="line"><span class="comment">// 입력으로 배열의 각 행 첫 열의 값과 인덱스를 담은 배열을 받아오고, 배열의 크기를 받아온다.</span></span><br><span class="line"><span class="comment">// 배열을 입력으로 받아오는 것이기 때문에, 따로 리턴 값을 지정해줄 필요는 없다.</span></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">bubble_sort_modi</span><span class="params">(<span class="keyword">int</span> arrVal[], <span class="keyword">int</span> arrIdx[], <span class="keyword">int</span> arrSize)</span></span>{ </span><br><span class="line"> <span class="comment">// 임시 저장 변수 선언</span></span><br><span class="line"> <span class="keyword">int</span> temp, tempIdx;</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 배열의 사이즈 만큼 반복</span></span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < arrSize; i++){ </span><br><span class="line"> <span class="comment">// 배열의 사이즈 - 1 만큼 반복 (다음 값을 봐야해서)</span></span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j = <span class="number">0</span>; j < arrSize<span class="number">-1</span>; j++){</span><br><span class="line"> <span class="comment">// 현재 값이 다음 값보다 크면</span></span><br><span class="line"> <span class="keyword">if</span>(arrVal[j] > arrVal[j+<span class="number">1</span>]){</span><br><span class="line"> <span class="comment">// 값을 바꿔라</span></span><br><span class="line"> temp = arrVal[j];</span><br><span class="line"> arrVal[j] = arrVal[j+<span class="number">1</span>];</span><br><span class="line"> arrVal[j+<span class="number">1</span>] = temp;</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 그리고 해당하는 인덱스의 위치도 바꿔라</span></span><br><span class="line"> tempIdx = arrIdx[j];</span><br><span class="line"> arrIdx[j] = arrIdx[j+<span class="number">1</span>];</span><br><span class="line"> arrIdx[j+<span class="number">1</span>] = tempIdx;</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line"> }</span><br><span class="line">}</span><br><span class="line"></span><br><span class="line"><span class="comment">// 입력으로 배열을 받아왔을 때 처리하는 방법과 배열까지 동적으로 선언해서 제공해주는 두 가지의 방법을 작성했다.</span></span><br><span class="line"><span class="comment">// 1. 입력으로 정렬할 배열의 주소를 받아올 때</span></span><br><span class="line"><span class="comment">// 2차원 배열의 경우, 고정된 값으로 선언했을 때에는 첫번째 입력에서 볼 수 있는 것처럼</span></span><br><span class="line"><span class="comment">// (자료형) arr[][열 사이즈]와 같이 선언해줘야한다.</span></span><br><span class="line"><span class="comment">// 입력으로 넣어주는 2차원 배열이 이중 포인터를 이용한 동적 할당으로 선언된 경우 두번째 입력에서 볼 수 있는 것처럼</span></span><br><span class="line"><span class="comment">// (자료형) **sortedArr 로 선언해주면 된다.</span></span><br><span class="line"><span class="comment">// 그리고 행과 열의 사이즈를 입력으로 넣어주면 된다.</span></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">sort2DArr</span><span class="params">(<span class="keyword">int</span> arr[][<span class="number">3</span>], <span class="keyword">int</span> **sortedArr, <span class="keyword">int</span> row)</span></span>{</span><br><span class="line"> <span class="comment">// 0으로 초기화된 값, 인덱스를 위한 배열을 선언</span></span><br><span class="line"> <span class="keyword">int</span> *seq = <span class="built_in">calloc</span>(row, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> <span class="keyword">int</span> *seq_idx = <span class="built_in">calloc</span>(row, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 받아온 배열에서 첫 행의 값 꺼내서 넣고, 행의 인덱스 채워넣기</span></span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < row; i++){</span><br><span class="line"> seq[i] = arr[i][<span class="number">0</span>];</span><br><span class="line"> seq_idx[i] = i;</span><br><span class="line"> }</span><br><span class="line"></span><br><span class="line"> <span class="comment">// 인덱스 정렬하기</span></span><br><span class="line"> bubble_sort_modi(seq,seq_idx,row);</span><br><span class="line"></span><br><span class="line"> <span class="comment">// 정렬된 인덱스에 따라서 정렬한 값을 넣을 배열에 값을 복사해서 넣기</span></span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < row; i++){</span><br><span class="line"> <span class="built_in">memcpy</span>(sortedArr[i],arr[seq_idx[i]],<span class="keyword">sizeof</span>(<span class="keyword">int</span>)*<span class="number">3</span>);</span><br><span class="line"> }</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 동적 할당한 배열 메모리 해제</span></span><br><span class="line"> <span class="built_in">free</span>(seq);</span><br><span class="line"> <span class="built_in">free</span>(seq_idx);</span><br><span class="line">}</span><br><span class="line"></span><br><span class="line"><span class="comment">// 2. 정렬할 배열을 만들어서 리턴해줄 때</span></span><br><span class="line"><span class="comment">// 동적 할당으로 선언된 배열을 이중포인터로 리턴해주고, 행렬의 사이즈를 잘 알려주면 리턴으로 받아서 이용할 수 있다.</span></span><br><span class="line"><span class="function"><span class="keyword">int</span>** <span class="title">sort2DArr2</span><span class="params">(<span class="keyword">int</span> arr[][<span class="number">3</span>], <span class="keyword">int</span> row)</span></span>{</span><br><span class="line"> <span class="comment">// 0으로 초기화된 값, 인덱스를 위한 배열을 선언</span></span><br><span class="line"> <span class="keyword">int</span> *seq = <span class="built_in">calloc</span>(row, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> <span class="keyword">int</span> *seq_idx = <span class="built_in">calloc</span>(row, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 받아온 배열에서 첫 행의 값 꺼내서 넣고, 행의 인덱스 채워넣기</span></span><br><span class="line"> <span class="keyword">int</span> **sortedArr = <span class="built_in">calloc</span>(row, <span class="keyword">sizeof</span>(<span class="keyword">int</span> *));</span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < row; i++){</span><br><span class="line"> sortedArr[i] = <span class="built_in">calloc</span>(<span class="number">3</span>, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> }</span><br><span class="line"></span><br><span class="line"> <span class="comment">// 받아온 배열에서 첫 행의 값 꺼내서 넣고, 행의 인덱스 채워넣기</span></span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < row; i++){</span><br><span class="line"> seq[i] = arr[i][<span class="number">0</span>];</span><br><span class="line"> seq_idx[i] = i;</span><br><span class="line"> }</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 인덱스 정렬하기</span></span><br><span class="line"> bubble_sort_modi(seq,seq_idx,row);</span><br><span class="line"></span><br><span class="line"> <span class="comment">// 정렬된 인덱스에 따라서 정렬한 값을 넣을 배열에 값을 복사해서 넣기</span></span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < row; i++){</span><br><span class="line"> <span class="built_in">memcpy</span>(sortedArr[i],arr[seq_idx[i]],<span class="keyword">sizeof</span>(<span class="keyword">int</span>)*<span class="number">3</span>);</span><br><span class="line"> }</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 동적 할당한 배열 메모리 해제</span></span><br><span class="line"> <span class="built_in">free</span>(seq);</span><br><span class="line"> <span class="built_in">free</span>(seq_idx);</span><br><span class="line"></span><br><span class="line"> <span class="keyword">return</span> sortedArr;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
<hr>
<h3 id="테스트코드"><a href="#테스트코드" class="headerlink" title="테스트코드"></a>테스트코드</h3><p>테스트 해볼 방법만 살려두고 주석처리하고 실행해야함</p>
<figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><stdio.h></span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><stdlib.h></span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string"><string.h></span></span></span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">bubble_sort_modi</span><span class="params">(<span class="keyword">int</span> arrVal[], <span class="keyword">int</span> arrIdx[], <span class="keyword">int</span> arrSize)</span></span>;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">sort2DArr</span><span class="params">(<span class="keyword">int</span> arr[][<span class="number">3</span>], <span class="keyword">int</span> **sortedArr, <span class="keyword">int</span> row)</span></span>;</span><br><span class="line"><span class="function"><span class="keyword">int</span>** <span class="title">sort2DArr2</span><span class="params">(<span class="keyword">int</span> arr[][<span class="number">3</span>], <span class="keyword">int</span> row)</span></span>;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>{</span><br><span class="line"></span><br><span class="line"> <span class="keyword">int</span> a[<span class="number">4</span>][<span class="number">3</span>] = {</span><br><span class="line"> {<span class="number">3</span>,<span class="number">2</span>,<span class="number">2</span>},</span><br><span class="line"> {<span class="number">6</span>,<span class="number">7</span>,<span class="number">3</span>},</span><br><span class="line"> {<span class="number">4</span>,<span class="number">5</span>,<span class="number">6</span>},</span><br><span class="line"> {<span class="number">7</span>,<span class="number">9</span>,<span class="number">2</span>}</span><br><span class="line"> };</span><br><span class="line"></span><br><span class="line"> <span class="comment">// 1번 방법으로 이용할 경우</span></span><br><span class="line"> <span class="keyword">int</span> **sortedArr = <span class="built_in">calloc</span>(<span class="number">4</span>, <span class="keyword">sizeof</span>(<span class="keyword">int</span> *));</span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> sortedArr[i] = <span class="built_in">calloc</span>(<span class="number">3</span>, <span class="keyword">sizeof</span>(<span class="keyword">int</span>));</span><br><span class="line"> }</span><br><span class="line"></span><br><span class="line"> <span class="keyword">int</span> seq[<span class="number">4</span>];</span><br><span class="line"> <span class="keyword">int</span> seq_idx[<span class="number">4</span>];</span><br><span class="line"> <span class="keyword">for</span> (<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> seq[i] = a[i][<span class="number">0</span>];</span><br><span class="line"> seq_idx[i] = i;</span><br><span class="line"> }</span><br><span class="line"></span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"Base a\n"</span>);</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j = <span class="number">0</span>; j < <span class="number">3</span>; j++){</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"%d "</span>,a[i][j]);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"></span><br><span class="line"> sort2DArr(a, sortedArr, <span class="number">4</span>);</span><br><span class="line"></span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"Sorted a\n"</span>);</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j = <span class="number">0</span>; j < <span class="number">3</span>; j++){</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"%d "</span>,sortedArr[i][j]);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> </span><br><span class="line"> <span class="comment">// 2번 방법으로 이용할 경우</span></span><br><span class="line"> <span class="keyword">int</span> **sortedArr;</span><br><span class="line"> </span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"Base a\n"</span>);</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j = <span class="number">0</span>; j < <span class="number">3</span>; j++){</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"%d "</span>,a[i][j]);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>); </span><br><span class="line"> </span><br><span class="line"> sortedArr = sort2DArr2(a, <span class="number">4</span>);</span><br><span class="line"></span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"Sorted a\n"</span>);</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> j = <span class="number">0</span>; j < <span class="number">3</span>; j++){</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"%d "</span>,sortedArr[i][j]);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">printf</span>(<span class="string">"\n"</span>);</span><br><span class="line"> </span><br><span class="line"></span><br><span class="line"> <span class="comment">// Free</span></span><br><span class="line"> <span class="keyword">for</span>(<span class="keyword">int</span> i = <span class="number">0</span>; i < <span class="number">4</span>; i++){</span><br><span class="line"> <span class="built_in">free</span>(sortedArr[i]);</span><br><span class="line"> }</span><br><span class="line"> <span class="built_in">free</span>(sortedArr);</span><br><span class="line"></span><br><span class="line"> <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">}</span><br></pre></td></tr></table></figure>
</div>
<footer class="article-footer">
<a data-url="http://yoursite.com/2020/01/20/c-16-sort2d/" data-id="ck5miwxst000097jd26os5obu" class="article-share-link">Share</a>
<ul class="article-tag-list" itemprop="keywords"><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/2d-array/" rel="tag">2d array</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/c/" rel="tag">C</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/array/" rel="tag">array</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/bubble-sort/" rel="tag">bubble sort</a></li><li class="article-tag-list-item"><a class="article-tag-list-link" href="/tags/sort/" rel="tag">sort</a></li></ul>
</footer>
</div>
</article>
<nav id="page-nav">
<span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><a class="page-number" href="/page/3/">3</a><span class="space">…</span><a class="page-number" href="/page/5/">5</a><a class="extend next" rel="next" href="/page/2/">Next &raquo;</a>
</nav>
</section>
<aside id="sidebar">
<div class="widget-wrap">
<h3 class="widget-title">Categories</h3>
<div class="widget">
<ul class="category-list"><li class="category-list-item"><a class="category-list-link" href="/categories/00-diary/">00_Diary</a><ul class="category-list-child"><li class="category-list-item"><a class="category-list-link" href="/categories/00-diary/dailydev/">DailyDev.</a></li></ul></li><li class="category-list-item"><a class="category-list-link" href="/categories/01-study/">01_Study</a><ul class="category-list-child"><li class="category-list-item"><a class="category-list-link" href="/categories/01-study/c/">C</a></li><li class="category-list-item"><a class="category-list-link" href="/categories/01-study/python/">Python</a></li></ul></li><li class="category-list-item"><a class="category-list-link" href="/categories/99-etc/">99_ETC</a><ul class="category-list-child"><li class="category-list-item"><a class="category-list-link" href="/categories/99-etc/test/">Test</a></li></ul></li></ul>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Recent Posts</h3>
<div class="widget">
<ul>
<li>
<a href="/2020/02/10/pythoncodefight-day19/">PythonCodeFight-Day19</a>
</li>
<li>
<a href="/2020/02/08/pythoncodefight-day18/">PythonCodeFight-Day18</a>
</li>
<li>
<a href="/2020/02/05/pythoncodefight-day17/">PythonCodeFight-Day17</a>
</li>
<li>
<a href="/2020/02/04/pythoncodefight-day16/">PythonCodeFight-Day16</a>
</li>
<li>
<a href="/2020/02/03/pythoncodefight-day15/">PythonCodeFight-Day15</a>
</li>
</ul>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Tags</h3>
<div class="widget">
<ul class="tag-list" itemprop="keywords"><li class="tag-list-item"><a class="tag-list-link" href="/tags/2d-array/" rel="tag">2d array</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/array/" rel="tag">Array</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/c/" rel="tag">C</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/can/" rel="tag">CAN</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/codefight/" rel="tag">CodeFight</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/codesignal/" rel="tag">CodeSignal</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/latex/" rel="tag">LaTex</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/matlab/" rel="tag">Matlab</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/pointer/" rel="tag">Pointer</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/pytorch/" rel="tag">PyTorch</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/python/" rel="tag">Python</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/rnn/" rel="tag">RNN</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/simulink/" rel="tag">Simulink</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/array/" rel="tag">array</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/bubble-sort/" rel="tag">bubble sort</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/c/" rel="tag">c++</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/colab/" rel="tag">colab</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/embedded-system/" rel="tag">embedded system</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/enum/" rel="tag">enum</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/function/" rel="tag">function</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/index-slicing/" rel="tag">index slicing</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/input/" rel="tag">input</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/memset/" rel="tag">memset</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/pointer/" rel="tag">pointer</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/quick-sort/" rel="tag">quick sort</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/return/" rel="tag">return</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/sort/" rel="tag">sort</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/static/" rel="tag">static</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/struct/" rel="tag">struct</a></li><li class="tag-list-item"><a class="tag-list-link" href="/tags/union/" rel="tag">union</a></li></ul>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Tag Cloud</h3>
<div class="widget tagcloud">
<a href="/tags/2d-array/" style="font-size: 10px;">2d array</a> <a href="/tags/array/" style="font-size: 15.71px;">Array</a> <a href="/tags/c/" style="font-size: 20px;">C</a> <a href="/tags/can/" style="font-size: 10px;">CAN</a> <a href="/tags/codefight/" style="font-size: 18.57px;">CodeFight</a> <a href="/tags/codesignal/" style="font-size: 18.57px;">CodeSignal</a> <a href="/tags/latex/" style="font-size: 10px;">LaTex</a> <a href="/tags/matlab/" style="font-size: 12.86px;">Matlab</a> <a href="/tags/pointer/" style="font-size: 12.86px;">Pointer</a> <a href="/tags/pytorch/" style="font-size: 10px;">PyTorch</a> <a href="/tags/python/" style="font-size: 18.57px;">Python</a> <a href="/tags/rnn/" style="font-size: 10px;">RNN</a> <a href="/tags/simulink/" style="font-size: 12.86px;">Simulink</a> <a href="/tags/array/" style="font-size: 14.29px;">array</a> <a href="/tags/bubble-sort/" style="font-size: 11.43px;">bubble sort</a> <a href="/tags/c/" style="font-size: 10px;">c++</a> <a href="/tags/colab/" style="font-size: 10px;">colab</a> <a href="/tags/embedded-system/" style="font-size: 10px;">embedded system</a> <a href="/tags/enum/" style="font-size: 10px;">enum</a> <a href="/tags/function/" style="font-size: 17.14px;">function</a> <a href="/tags/index-slicing/" style="font-size: 10px;">index slicing</a> <a href="/tags/input/" style="font-size: 14.29px;">input</a> <a href="/tags/memset/" style="font-size: 10px;">memset</a> <a href="/tags/pointer/" style="font-size: 15.71px;">pointer</a> <a href="/tags/quick-sort/" style="font-size: 10px;">quick sort</a> <a href="/tags/return/" style="font-size: 10px;">return</a> <a href="/tags/sort/" style="font-size: 11.43px;">sort</a> <a href="/tags/static/" style="font-size: 10px;">static</a> <a href="/tags/struct/" style="font-size: 15.71px;">struct</a> <a href="/tags/union/" style="font-size: 10px;">union</a>
</div>
</div>
<div class="widget-wrap">
<h3 class="widget-title">Archives</h3>
<div class="widget">
<ul class="archive-list"><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/02/">February 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/01/">January 2020</a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2019/12/">December 2019</a></li></ul>
</div>
</div>
</aside>
</div>
<footer id="footer">
<div class="outer">
<div id="footer-info" class="inner">
© 2020 Sunbin Vincent Kim<br>
Powered by <a href="http://hexo.io/" target="_blank">Hexo</a>
</div>
</div>
</footer>
</div>
<nav id="mobile-nav">
<a href="/" class="mobile-nav-link">Home</a>
<a href="/archives" class="mobile-nav-link">Archives</a>
</nav>
<script src="//ajax.googleapis.com/ajax/libs/jquery/2.0.3/jquery.min.js"></script>
<link rel="stylesheet" href="/fancybox/jquery.fancybox.css">
<script src="/fancybox/jquery.fancybox.pack.js"></script>
<script src="/js/script.js"></script>
</div>
</body>
</html>