꿈꾸는공학도

https://leetcode.com/problems/last-stone-weight/description/You are given an array of integers stones where stones[i] is the weight of the ith stone.We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them together. Suppose the heaviest two stones have weights x and y with x If x == y, both stones are destroyed, andIf x != y, the stone of weight x is ..

Python / C / C++에서 Array / Linked List 기반으로 heap 구조를 만들어보겠다. Skeleton Code는 GPT를 참고했으며, Min/Max heap은 사실 한 끝 차이라 이 둘을 그냥 번갈아가면서 구현해보기로 한다. 1. Python - Array - Min heapclass PriorityQueueArray: def __init__(self, is_min=True): self.heap = [] self.is_min = is_min # True for min-heap, False for max-heap def parent(self, i): return (i - 1) // 2 def left_child(self, i):..

Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required.입출력 예시Example 1:Input: intervals = [[0,30],[5,10],[15,20]]Output: 2Example 2:Input: intervals = [[7,10],[2,4]]Output: 1제약사항1  Leetcode의 meeting room #2 문제이다. 문제확인을 위해 유료결제가 필요하지만 그냥 구글링해서 문제를 긁어왔다. 실습시간에도 사용된 문제이니 함 풀어보자   1. C++쉬운 줄 알고 아래처럼 풀었는데,쉽지 않았다....

https://leetcode.com/problems/implement-queue-using-stacks/description/Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).Implement the MyQueue class:void push(int x) Pushes element x to the back of the queue.int pop() Removes the element from the front of the queue and returns i..

https://leetcode.com/problems/battleships-in-a-board/description/Given an m x n matrix board where each cell is a battleship 'X' or empty '.', return the number of the battleships on board.Battleships can only be placed horizontally or vertically on board. In other words, they can only be made of the shape 1 x k (1 row, k columns) or k x 1 (k rows, 1 column), where k can be of any size. At least..

https://leetcode.com/problems/largest-number/description/Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.Since the result may be very large, so you need to return a string instead of an integer. Example 1:Input: nums = [10,2]Output: "210"Example 2:Input: nums = [3,30,34,5,9]Output: "9534330" Constraints:1 0 문제 자체는 일단 설명이 짧아서 좋다. 한 번 D..

https://leetcode.com/problems/sort-characters-by-frequency/description/Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.Return the sorted string. If there are multiple answers, return any of them. Example 1:Input: s = "tree"Output: "eert"Explanation: 'e' appears twice while 'r' and..

http://topcoder.bgcoder.com/print.php?id=2390 TopCoder problem "DiamondMining" used in TCHS09 Round 3 (Division I Level Three)     A diamond mine is a matrix of ones and zeroes with R rows and C columns. A diamond is a pattern of ones forming the boundary of a 45-degree rotated square. The diamonds of size 1, 2, and 3 are shown below. size 1: size 2: size 3: 1 1 1 1 1 1 1 1 1topcoder.bgcoder.com..

https://leetcode.com/problems/largest-rectangle-in-histogram/description/Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram. Example 1:Input: heights = [2,1,5,6,2,3]Output: 10Explanation: The above is a histogram where width of each bar is 1.The largest rectangle is shown in the re..

https://www.geeksforgeeks.org/edit-distance-dp-5/ Edit Distance - GeeksforGeeksA Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.www.geeksforgeeks.orgGiven two strings s1 and s2 of lengths m and n respectively and below operations that c..