<p data-ke-size="size16"><a href="https://leetcode.com/problems/length-of-last-word/desc​ription/?" target="_blank" rel="noopener noreferrer">https://leetcode.com/problems/length-of-last-​word</a></p> <p... Tag: Algorithm, leetcode

<p data-ke-size="size16"><a href="https://leetcode.com/problems/isomorphic-strings/"​; target="_blank" rel="noopener noreferrer">https://leetcode.com/problems/isomorphic-stri​ngs/</a></p> <p data-ke-siz... Tag: Algorithm, leetcode

<p data-ke-size="size16"><a href="https://leetcode.com/problems/word-search/description&​quot; target="_blank" rel="noopener noreferrer">https://leetcode.com/problems/word-search/des​cription</a></p> <p data-ke-size="... Tag: Algorithm, leetcode

<p data-ke-size="size16"><a href="https://leetcode.com/problems/maximum-nesting-depth-of​-the-parentheses/" target="_blank" rel="noopener noreferrer">https://leetcode.com/problems/maximum-nesting​-depth-of-... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/product-of-array-except-self O(1)의 공간으로 나눗셈 연산 없이 해결해야 합니다. i번째를 제외한 좌/우측의 prefix product를 구해주면 됩니다. res[i] = 좌_prefix_product[i] * 우_prefix_product[i] class Solution { ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/contiguous-array/description nums[i]가 1이라면 1을, 0이라면 -1을 변수에 더해줍니다. 그리고 각 합에 대한 인덱스를 map에 기억해줍니다. 이후에 순회하면서 해당 합을 다시 가지게 된다면,... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/merge-in-between-linked-lists/descr​iption list1의 삭제 시작/종료 포인터를 구해서, list2를 끼워넣어줍니다. class Solution { public: ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* l... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/intersection-of-two-arrays 배열에 nums1의 값 여부를 기록해두고, nums2를 순회하며 nums1에도 존재하는 값인지 확인해줍니다. class Solution { public: vector<int> intersection(vector<int>\& nums1, vector<int>... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/count-elements-with-maximum-frequen​cy class Solution { public: int maxFrequencyElements(vector<int>\& nums) { int cnt[101] = {0}, mx = 0, res = 0; for(int num : nums) mx = max(mx, ++... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/linked-list-cycle/description Linked List Cycle - LeetCode Can you solve this real interview question? Linked List Cycle - Given head, the head of a linked list, determi... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/middle-of-the-linked-list/ 2개의 포인터를 각각 한 칸, 두 칸씩 이동해줍니다. 두 칸씩 이동한 포인터가 끝에 도달하면, 한 칸씩 이동한 포인터가 중간이 됩니다. class Solution { public: ListNode* middleNode(ListNode* ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/diameter-of-binary-tree/ Diameter of Binary Tree - LeetCode Can you solve this real interview question? Diameter of Binary Tree - Given the root of a binary tree, return ... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/even-odd-tree Even Odd Tree - LeetCode Can you solve this real interview question? Even Odd Tree - A binary tree is named Even-Odd if it meets the following conditions: *... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/squares-of-a-sorted-array Squares of a Sorted Array - LeetCode Can you solve this real interview question? Squares of a Sorted Array - Given an integer array nums sorted... Tag: Algorithm, leetcode

반응형 https://leetcode.com/problems/remove-nth-node-from-end-of-list Remove Nth Node From End of List - LeetCode Can you solve this real interview question? Remove Nth Node From End of List - Given the head... Tag: Algorithm, leetcode