Programmer Think

Starting with the end means setting goals first and then making plans in daily life. I learned this concept when I read management books before.In the algorithm, taking the end as the beginning refers to pushing back from the result to the initial state of the problem.So when is it appropriate to think in reverse? A very simple principle is:The ...

Find the median of two positively ordered arrays Method 1: binary search Given two ordered arrays, it is required to find the median of two ordered arrays. The most intuitive ideas are as follows: Using the merging method, merge two ordered arrays to get a large ordered array. The element in the middle of a large ordered array is the median. ...

Take you hand in hand to disassemble the LRU algorithm summary LRU algorithm is a cache elimination strategy. The principle is not difficult, but it is more skilled to write bug free algorithms in the interview. It needs to abstract and disassemble the data structure layer by layer. labuladong in this paper will write you beautiful code. ...

leetcode daily question of deleting duplicate elements in the sorting linked list Title Link: https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/submissions/ Title Description: There is a linked list arranged in ascending order. Give you the head node of the linked list. Please delete all nodes with duplicate numbers in t ...

Difficulty: difficulty catalogue 1, Problem description 2, Problem solving thought 3, Problem solving 1. Judge extreme situations 2. Code implementation 4, Summary 1, Problem description The problem description above LeetCode is directly used here. Cities are represented by a two-way connected graph, in which there are n nodes, numbe ...

Sword finger Offer 38 Arrangement of strings Enter a string and print out all the arrangements of characters in the string. You can return this string array in any order, but there can be no duplicate elements in it. Example: Enter: s = "abc" Output: ["abc", "acb", "bac", "bca", "cab&quo ...

Title Requirements Link to the original title: 23. Merge K Ascending Chain Lists The Title requirements are as follows: Give you an array of lists, each in ascending order. Please merge all lists into one ascending list and return the merged list. Examples are as follows: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] ...

☘ preface ☘ What can you learn after reading this blog? Reading and writing methods of excel How to get the interface Multithreading improves crawler efficiency Cloud server deployment web service real-time update In this blog, based on the previous article, I will further explore the website interface api to improve the access speed, fur ...

This topic aims to share some interesting or valuable topics found in the process of brushing Leecode. [answer based on js, of course].Recursive algorithm has always been one of the key types of leetcode medium difficulty exercises, so the key is self-evident.Topic relatedOriginal address: https://leetcode-cn.com/problems/dui-cheng-de-er-cha-sh ...

Give two positively ordered (from small to large) arrays nums1 and nums2 of sizes m and n, respectively. Please find and return the median of these two positive arrays. The time complexity of the algorithm should be O(log (m+n)). Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merge array = [1,2,3], median 2 Exam ...