꿈꾸는공학도

https://leetcode.com/problems/semi-ordered-permutation/You are given a 0-indexed permutation of n integers nums.A permutation is called semi-ordered if the first number equals 1 and the last number equals n. You can perform the below operation as many times as you want until you make nums a semi-ordered permutation:Pick two adjacent elements in nums, then swap them.Return the minimum number of o..

https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/You are given two 0-indexed integer arrays nums1 and nums2 of length n.Let's define another 0-indexed integer array, nums3, of length n. For each index i in the range [0, n - 1], you can assign either nums1[i] or nums2[i] to nums3[i].Your task is to maximize the length of the longest non-decreasing subarray in nums3 by..

https://leetcode.com/problems/largest-odd-number-in-string/description/You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd integer exists.A substring is a contiguous sequence of characters within a string. Example 1:Input: num = "52"Output: "5"Explanation: The only non-..

https://leetcode.com/problems/build-array-from-permutation/Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0  and return it.A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive). Example 1:Input: nums = [0,2,1,5,3,4]Output: [0,1,2,4,5,3]Explanation: The array ans is built a..

https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1:Input: haystack = "sadbutsad", needle = "sad"Output: 0Explanation: "sad" occurs at index 0 and 6.The first occurrence is at index 0, so we return 0.Exa..

https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.Consider the number of unique elements of nums to be k, to get accepte..

https://leetcode.com/problems/add-two-numbers/description/You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1:Input: l1 = ..

https://eglife.tistory.com/43 4. Functions and Memory Management https://eglife.tistory.com/36 3. C++ Standard Library (3) https://eglife.tistory.com/35 2. C++ Standard Library (2) https://eglife.tistory.com/34 1. C++ Standard Library (1) 아 ~ 이게 무슨 영어, 중국어 배우는 것도 아니고 코딩하나 하 eglife.tistory.com C++에서도 오고야 말았다.. Class! 파이썬때도 살짝 맛 봤었으나 매콤했던 걸로 기억하는데.. OOP를 위해선 어쩔 수 없이 익숙해져야 하는 클라스!! 클래스!! Classes Cl..

https://eglife.tistory.com/40 3. Control Structures in C - Condition ( While / For Loop ) https://eglife.tistory.com/33 2-1. Operators / Memory in C https://eglife.tistory.com/32 2. Variables in C 아무리 봐도 불친절한 C.. 파이썬을 배우다가 와서 그런가 불편한 게 이만 저만이 아니다. 그래도 파이썬코드보 eglife.tistory.com If / Else / While 같은 건 C나 Python이나 비슷하다. 다만, Indentation / 중괄호로 구문을 구분하는 것들이 좀 차이가 있다. Python과 C에서 Function / Memory 부분이..

아 ~ 이게 무슨 영어, 중국어 배우는 것도 아니고 코딩하나 하는데도 프로그래밍 언어가 너무 많다;; 이거 누가 통일 좀 안 시키나ㅠㅠ 그래도 써먹을데가 분명히 있다고 하니까 이놈의 C++ 공부도 한 번 시작해본다. C++의 장점은 위와 같다고 한다. 정확히 이게 어떤 걸 의미하는 지는 차차 알아가 봐야 할 부분 모든 프로그래밍 언어를 배울 때 처럼 Hello C++ 부터 공부해보자ㅠㅠ First C++ Program #include int main(void) { std::cout iostream ( C++ Header file 종류 장난 없다.. 엄청 많고 다 암기 必 ) 3) Print function : printf; --> std::cout 4) New line : ' \n ' --> std::e..