전체 글

https://school.programmers.co.kr/learn/courses/30/lessons/12939 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr 알게된 것 stringstream 을 사용해서 while(ss >> temp) 로 하나씩 뽑을 수 있다는 것. 내 코드 #include #include #include #include using namespace std; string solution(string s) { string answer = ""; long long max = -10000000; long long min = 10000000..

2022.07.18 책 구매 ~ 2022.07.28 책 완독 기억했으면 하는 것들을 위주로 기록 1장 헬로파이썬 기본적인 파이썬 문법을 설명한다. python3 을 기준으로 작성된 소스코드들. 넘파이: 넘파이는 배열이나 행렬 계산에 용이한 메서드들이 준비되어있는 외부 라이브러리 원소별: element-wise 원소별 곱셈: element-wise product * 논문에 종종 나오는 것 봤던 기억이 있습니다. 이제야 뜻을 정확히 알게 된 것 같아 속이 시원하네요 브로드캐스트: 형상이 다른 배열끼리도 계산할 수 있도록 지원하는 기능 ex) 2 x 2 행렬에 스칼라 값 10 을 곱할 수 있게 합니다. 스칼라 값 10이 2x2 행렬로 확대됩니다. 1 2 * 10 = 1 2 * 10 10 = 10 20 3 4 ..

https://leetcode.com/problems/average-selling-price/ Account Login - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com select a.product_id, round(sum(a.price * b.units)/sum(b.units), 2) as average_price from Prices as a left outer join UnitsSold as b on a.product_id = b.product_id an..

https://leetcode.com/problems/unique-orders-and-customers-per-month/ Account Login - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com select date_format(order_date, '%Y-%m') as month, count(distinct order_id) as order_count, count(distinct customer_id) as customer_count from Orders ..

https://leetcode.com/problems/npv-queries/ Account Login - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com select b.id, b.year, IFNULL(a.npv, 0) as npv from NPV as a right outer join Queries as b on a.id = b.id and a.year = b.year

https://leetcode.com/problems/delete-and-earn/ class Solution { public: int deleteAndEarn(vector& nums) { int max_val = *max_element(nums.begin(), nums.end()); vector values(max_val+1, 0); for(int num: nums) { values[num] += num; } int dp[max_val+ 1]; dp[0] = values[0]; dp[1] = max(values[0], values[1]); for(int i = 2; i < max_val + 1; i++) { dp[i] = max(dp[i-2] + values[i], dp[i-1]); } return m..

https://leetcode.com/problems/products-price-for-each-store/ Account Login - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com select product_id, max(case when store = 'store1' then price end) as store1, max(case when store = 'store2' then price end) as store2, max(case when store = ..

https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/ Account Login - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com select a.student_name as member_A, b.student_name as member_B, c.student_name as member_C from SchoolA as a, SchoolB as b, SchoolC as c whe..