지니 Programming

Python class Solution(object): def largeGroupPositions(self, s): """ :type s: str :rtype: List[List[int]] """ result = list() before_str = "" start_index = -1 for i, alphabet in enumerate(s+ " "): if alphabet != before_str: # 현재 값과 이전 값이 다름 if i - start_index + 1 > 3: result.append([start_index, i - 1]) before_str = alphabet start_index = i return result

MySQL # Write your MySQL query statement below SELECT Person.firstName, Person.lastName, Address.city, Address.state FROM Person LEFT JOIN Address on Person.personId = Address.personId;

python class MinStack: def __init__(self): self.stack = [] def push(self, val: int) -> None: self.stack.append(val) def pop(self) -> None: self.stack.pop() def top(self) -> int: return self.stack[-1] def getMin(self) -> int: return min(self.stack) # Your MinStack object will be instantiated and called as such: # obj = MinStack() # obj.push(val) # obj.pop() # param_3 = obj.top() # param_4 = obj.g..

Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def __init__(self): self.l = [] def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]: self.inorder(root) return self.l def inorder(self, root: Optional[TreeNode]): if root: self.inorder(root.left) s..

Python class Solution: def addBinary(self, a: str, b: str) -> str: return bin(int(a, 2) + int(b, 2))[2:]

Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right from collections import deque class Solution: def maxDepth(self, root: Optional[TreeNode]) -> int: max_depth = 0 que = deque() que.append((root, 0)) while que: node, depth = que.popleft() if node == None: max_depth = max(max_de..

Python class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: count = 0 g_index = 0 s_index = 0 g.sort(reverse=True) s.sort(reverse=True) while g_index = g[g_index]: count += 1 s_index += 1 g_index += 1 else: g_index += 1 return count

Python class Solution: def longestPalindrome(self, s: str) -> int: s_set = set(list(s)) count = 0 count_solo = False for ch in s_set: ch_count = s.count(ch) // 2 count += ch_count * 2 if s.count(ch) % 2 != 0: count_solo = True if count_solo: count += 1 return count

Python class Solution: def fib(self, n: int) -> int: fibonacci = [] fibonacci.extend([0, 1]) for i in range(2, n + 1): fibonacci.append(fibonacci[-1] + fibonacci[-2]) return fibonacci[n] Java class Solution { public int fib(int n) { if (n == 0) { return 0; } int[] fibonacciArray = new int[n + 1]; fibonacciArray[0] = 0; fibonacciArray[1] = 1; for (int i = 2; i < fibonacciArray.length; i++) { fibo..

Python class Solution: def lengthOfLastWord(self, s: str) -> int: # 두번째 방법 72% 빠름 s = s.rstrip() for i in range(len(s) - 1, 0 - 1, -1): if s[i] == " ": return len(s) - i - 1 return len(s) # 첫번째 방법 85% 빠름 # return len(s.rstrip().split()[-1]) Java class Solution { public int lengthOfLastWord(String s) { s = s.strip(); String[] sList = s.split(" "); return (sList[sList.length - 1]).length(); } }