문제 : https://leetcode.com/problems/is-subsequence/description/ 난이도 : Easy 문자열 s가 t에 포함되어 있는지 찾는 문제다. 어떻게 할까 고민하다가 그냥 찾으면 그 위치부터 자르고, 찾으면 자르고 단순하게 풀기로 했다. (늘 그랬음;;) 풀이1 class Solution: def isSubsequence(self, s: str, t: str) -> bool: answer = False tIdx, sIdx = 0, 0 if len(s) > len(t): return False if len(s) == 0: return True while len(t) > 0 and tIdx > -1: tIdx = t.find(s[sIdx]) if(tIdx > -1): #..
문제 : https://leetcode.com/problems/search-a-2d-matrix/ 난이도 : Medium 풀이1 --- Brute Force class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: for arr in matrix: if target bool: lo, hi = 0, len(matrix) - 1 while lo row[-1]: lo = midRow + 1 else: l, h = 0, len(row) - 1 while l row[mid]: l = mid + 1 else: h = mid - 1 return False '이미 정렬이 되어있는 배열에서 원소를 찾는다!' -> 이진트리를 ..
문제: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/ 난이도: Medium You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee. Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. N..
문제: https://leetcode.com/problems/valid-anagram/ 난이도: easy Anagaram 개념만 알면 쉽게 생각해서 풀 수 있는 문제다. 풀이 class Solution: def isAnagram(self, s: str, t: str) -> bool: if s is None or t is None: return False if len(s) != len(t): return False if sorted(s) == sorted(t): return True
