Channi Studies

In the final post, we looked into the selection sorting algorithm.https://code-studies.tistory.com/124 [Sorting] Insertion SortIn the final post, we have studied about the selection sort and its implementation in Python. https://code-studies.tistory.com/123 [Sorting] Introduction & Selection SortSorting Sorting is the process of converting a list of elements into ascending (code-studies.tistory...

In the final post, we have studied about the selection sort and its implementation in Python. https://code-studies.tistory.com/123 [Sorting] Introduction & Selection SortSorting Sorting is the process of converting a list of elements into ascending (or descending) order.You may remember the importance of sorting in binary search from my previous post. In the following few posts, we will be study..

Sorting Sorting is the process of converting a list of elements into ascending (or descending) order.You may remember the importance of sorting in binary search from my previous post. In the following few posts, we will be studying about the types of sorting algorithms. These are some examples of (un)sorted data(3, 9, 44, 18, 76): Not sorted(20, 15, 10, 5, 0): Sorted into descending order(99.87,..

https://leetcode.com/problems/maximal-square/description/  이 문제를 풀기 위해서 nested for loop을 사용했습니다.Input n x m 에 맞춰 각 반복문에서 현재 위치 기준으로 좌단, 상단, 좌상단 index를 모두 확인하여 그 중 최솟값에 + 1을 하는 전략을 취했습니다. 만약 현재 인덱스가 0이라면 해당 위치에서 구성할 수 있는 최대 사각형의 넓이 또한 0이므로, 즉시 다음 반복문으로 넘어갑니다. 매 반복문의 마지막에 max_num을 업데이트 해주면서, 최종적으로 길이의 제곱을 반환해 넓이 값을 리턴합니다. def maximalSquare(self, matrix: List[List[str]]) -> int: n = len(matrix) ..