얼렁뚱땅 Data Science

Description There are n flights that are labeled from 1 to n. You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved for each flight in the range. Return an array answer of length n, where answer[i] is the total number of seats reserved for flight i. Example 1: In..

Description Given a non-negative integer c, decide whether there're two integers a and b such that a2 + b2 = c. Example 1: Input: c = 5 Output: true Explanation: 1 * 1 + 2 * 2 = 5 Example 2: Input: c = 3 Output: false Example 3: Input: c = 4 Output: true Example 4: Input: c = 2 Output: true Example 5: Input: c = 1 Output: true My Solution class Solution: def judgeSquareSum(self, c: int) -> bool:..

이번에 새롭게 캐글 컴피티션에 참가하면서 이번에는 kaggle API를 꼭 써보겠다 마음먹었는데.... 데이터 파일이 너무 커서 그런지 다운이 안되더라구요.... 더 찾아보기 귀찮아서 결국 dataset을 직접 다운받고 google colab에서 압축을 풀었습니다! 그럼 google colab에서 압축파일 푸는 법을 알려드릴께요! 1. google drive에서 새로운 google colab파일을 연다. 2. 드라이브를 mount한다. 3. cd "/content/drive/파일 위치.../" 4. !zip -qq "/content/drive/파일 위치.../data.zip" 저는 이게 편해서 이제 이렇게 써야겠어요. submission할때만 kaggle API쓸꺼야! 흥!

Description There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly with city c, then city a is connected indirectly with city c. A province is a group of directly or indirectly connected cities and no other cities outside of the group. You are given an n x n matrix isConnected where isConnected[i][j] = 1 i..

Description You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target. We will send a signal from a given node k. Return the time it takes for all the n nodes to receive the signal. ..

Description Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: My solution class Solution: def getRow(self, rowIndex: int) -> List[int]: array = [1] * 34 array[0] = [1] array[1] = [1,1] for i in range(2,34): array[i] = [1] for k in range(i-1): array[i].append(array[..

Description 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: My solution class Solution: def generate(self, numRows: int) -> List[List[int]]: array = [1] * 30 array[0] = [1] array[1] = [1,1] for i in range(2,30): array[i] = [1] for k in range(i-1): array[i].append(array[i - 1][k] +..

Description You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? My Solution class Solution: def climbStairs(self, n: int) -> int: array = [0] * 46 array[1] = 1 array[2] = 2 for i in range(3, 46): array[i] = array[i - 1] + array[i - 2] return array[n] 문제 출처 : https://leetcode.com/problems..

Description Given an array of integers nums sorted in ascending 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. My Solution class Solution: def searchRange(self, nums: List[int], target: int) -> List[int]: from bisect import bisect_left, bisect_right if target..

Description Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). My Solution class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: new_list = [] i, j = 0, 0 while(i < len(nums1) and j < len(nums2)): if nums1[i]