본문 바로가기

728x90

리트코드 파이썬 문제 풀이

문돌이 존버/프로그래밍 스터디 2021. 9. 26.
(leetcode 문제 풀이) Add Binary Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" Constraints: - 1 len(b): for _ in range(len(a) - len(b)): b = '0' + b else: for _ in range(len(b) - len(a)): a = '0' + a std_len = max(len(a), len(b)) # 맨 뒤의 원소를 먼저 비교해서 높임 여부 확인 if a[-1] == '1' and b[-1] == '1': carry =..
문돌이 존버/프로그래밍 스터디 2021. 7. 28.
(leetcode 문제 풀이) Linked List Cycle Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter. Return true if there is a cycle..
문돌이 존버/프로그래밍 스터디 2021. 7. 25.
(leetcode 문제 풀이) Single Number Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Example 1: Input: nums = [2,2,1] Output: 1 Example 2: Input: nums = [4,1,2,1,2] Output: 4 Example 3: Input: nums = [1] Output: 1 Constraints: 1. 1 1100 0011 오른쪽 시프트 연산자. 변수 값을 오른쪽으로 지정된 비트 수 만..

728x90

티스토리툴바