작심삼일

My Summary & Opinion YOLO는 bounding box와 classification을 동시에 진행함으로써 그 속도를 매우 빠르게 했다. 또한 이미지 전체를 보고 판단하기 때문에 Fast R-CNN보다 background error가 적다. 왜냐하면 Fast R-CNN는 각 패치별로 classification을 진행하기 때문이다. YOLO의 단점은 명확하다. 박스별로 하나의 class만 예측하기 때문에 겹쳐 있는 물체는 잘 판단하지 못하고, Data에 없던 새로운 형태의 bounding box는 잘 예측하지 못한다. 그렇게 유명한 YOLO 논문을 이제서야 읽었는데, 왜이렇게 사람들이 열광했는지 알 것 같았다. Bounding box와 classification을 동시에 진행하는 아이디어가 ..

문제 링크: https://leetcode.com/problems/find-and-replace-pattern/ 문제 Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the desired word. Recall that a permutation of lette..

문제 링크: https://leetcode.com/problems/valid-anagram/ 문제 Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. 조건 1

문제 링크: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ 문제 Given the root of a binary tree, flatten the tree into a "linked list": The "linked list" should use the same TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null. The "linked list" should be in the same order as a pre-order traversal of the binary tre..

문제 링크: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ 문제 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself..

문제 링크: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/ 문제 Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity. 조건 $0$

문제 링크: https://leetcode.com/problems/partition-list/ 문제 Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. Example 1: 조건 The number of nodes in the list is in the range [0, 200]. -100

문제 링크: https://leetcode.com/problems/pascals-triangle/ 문제 Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: 조건 1