Made in Code

Summary:The problem requires determining if the largest element in an array is at least twice as large as every other element. The solution involves two steps: first, finding the maximum element and its index, and then verifying its dominance by checking

This summary describes how to design a special dictionary that supports prefix and suffix search.Key points:Trie structure using composite keys: store all possible suffix#prefix combinations for each word in the trieIndex tracking: each trie node store

Abstract: This problem requires calculating the shortest time to send a signal from a given node k to all other nodes in the network. Use Dijkstra's algorithm to solve the single-source shortest path: First, construct an adjacency list to represent the gra

Abstract:This problem requires collecting the most cherries from the starting point (0,0) to the end point (n-1,n-1) in an n×n grid. The rules are: movement can only be to the right or down (outbound) and left or up (return), cannot pass through thorns (-

Summary:Problem: Given an array, maximize points by deleting numbers while also deleting adjacent numbers (nums[i]-1 and nums[i]+1).Approach:Sort and group numbers to count frequencies.Use dynamic programming to decide whether to take a number (earn i

An integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.Given an integer n, return *the largest number that is less than or equal to n with monotone increasing digits.*

The abstract of this article can be summarized as follows:Lisp expression parsing algorithmThis paper proposes a recursive solution for parsing Lisp-like expressions. The algorithm handles nested expressions through recursive descent parsing and uses a s

This problem implements the flood fill algorithm using depth-first search (DFS). Starting from a given pixel (sr,sc), we recursively traverse horizontally and vertically adjacent pixels with the same original color, changing them to the target color. The s

This article introduces the C language solution for LeetCode 732 "My Calendar III". This problem requires that after each new event [startTime, endTime) is added, the maximum number of overlaps k of all current events is returned.Key ideas:Use a differe

Article Abstract:This article describes how to implement a calendar system that ensures that no triple bookings (i.e., three events overlapping in a certain time period) are generated when new events are added. The solution consists of two lists: a single

The problem requires converting all uppercase letters in a string to lowercase. The solution involves iterating through each character using a pointer, checking if it is an uppercase letter (A-Z), and converting it to lowercase by adding 32 (the ASCII diff

Problem: Count distinct palindromic subsequences in string with only 'a','b','c','d' charactersCore Idea: Use DP where dp[i][j][c] = count of palindromes in range [i,j] starting/ending with character cKey Insight: For palindromes starting/ending with sam

This article introduces a C language implementation for managing calendar events. The main function is to add new events and ensure that double bookings with overlapping times do not occur. The core of the implementation is to use a linked list to store al

Self-dividing numbers are numbers divisible by every digit they contain, excluding those with the digit zero. Given a range [left, right], the task is to identify all such numbers within this range. The solution involves iterating through each number in th

This problem requires parsing a chemical formula and calculating the number of each atom. The chemical formula may contain nested parentheses and multiplicities represented by numbers. The solution is to use a stack to handle nested structures, storing the

The problem requires splitting a singly linked list into k consecutive parts with lengths as equal as possible. The solution involves first counting the total number of nodes in the list. Then, the base size for each part is calculated by dividing the tota

The question requires removing comments from C++ source code, including line comments ("//") and block comments ("/* ... */"). The solution is to traverse each line of code, use the flag inBlock to determine whether it is in a block comment, and use the bu

Summary:The problem involves merging accounts based on shared emails. Each account contains a name and a list of emails. If two accounts share at least one email, they belong to the same person. The goal is to merge these accounts and return them in a spe

Given a string array words, representing an English dictionary, you are required to return the longest word that can be built up step by step through other words. If there are multiple words that meet the criteria, return the one with the smallest lexicogr

This problem requires finding the kth smallest pair distance in an array. First, sort the array to simplify distance calculations. Then use binary search to find the target distance between the minimum distance 0 and the maximum distance (the last element

The problem requires finding the maximum length of a subarray that appears in both given integer arrays, nums1 and nums2. A dynamic programming approach is used to solve this efficiently. A 2D DP table is constructed where dp[i][j] represents the length of

This problem requires determining whether a given binary array ends with a single character (0). By traversing the array, when encountering 1, skip the next bit, because 1 always represents two characters (10 or 11); when encountering 0, only move one bit

Range Module is a data structure for tracking numeric ranges, supporting add, query, and delete operations for half-open intervals [left, right). The core idea of ​​the implementation is to manage intervals through a dynamic array and merge or split interv

The question requires calculating the number of all consecutive subarrays in the array whose product is strictly less than a given integer k. If k is less than or equal to 1, return 0 directly, because no positive product will be less than 1. Use the slidi

To express something in English, ensure that the language used is clear, concise, and follows standard grammatical rules. Here are some tips to help improve English communication:Practice regularly by reading, writing, speaking, and listening to English c

【代码】LeetCode //C - 710. Random Pick with Blacklist。

【代码】LeetCode //C - 709. To Lower Case。

【代码】LeetCode //C - 695. Max Area of Island。

【代码】LeetCode //C - 707. Design Linked List。

【代码】LeetCode //C - 706. Design HashMap。

【代码】LeetCode //C - 705. Design HashSet。

【代码】LeetCode //C - 703. Kth Largest Element in a Stream。

【代码】LeetCode //C - 701. Insert into a Binary Search Tree。

【代码】LeetCode //C - 699. Falling Squares。

【代码】LeetCode //C - 698. Partition to K Equal Sum Subsets。

【代码】LeetCode //C - 697. Degree of an Array。

【代码】LeetCode //C - 696. Count Binary Substrings。

【代码】LeetCode //C - 695. Max Area of Island。

【代码】LeetCode //C - 693. Binary Number with Alternating Bits。

【代码】LeetCode //C - 692. Top K Frequent Words。