Programmer Think

leetcode lecture on algorithm interview in Dachang 8. Sliding window Video tutorial (efficient learning): Click to learn catalog: 1. Introduction 2. Time and space complexity 3. Dynamic planning 4. Greed 5. Binary search 6. Depth first & breadth first 7. Double pointer 8. Sliding window 9. Bit operation 10. Recursion & divide and conque ...

This article is based on Datewhale Phase 31 Team Learning Binary Lookup Code: class Solution: def search(self, nums: List[int], target: int) -> int: left = 0 right = len(nums) - 1 # Find target within interval [left, right] while left <= right: # Take Interval Middle Node mid = ...

Daily question 1 - Martians subject Man finally landed on the land of Mars and met the mysterious Martians. Neither humans nor Martians can understand each other's language, but our scientists have invented a way to communicate digitally. This communication method is like this. First, the Martians tell human scientists a very large number. ...

📢 Hello, I'm Xiaocheng, a sophomore front-end enthusiast 📢 This article will explain collections in data structures 📢 Thank you very much for reading. You are welcome to correct the wrong places 🙏 📢 May you be loyal to yourself and love life 💡 First look at knowledge points What is a collection?What methods do collecti ...

preface There are too few problems in dynamic programming. Brush some problems, practice the awareness of solving problems with dynamic programming and know some common skills.Each question in the article has written some important points and ideas for me to understand this question.If you have any questions, please comment. 1. Sword fi ...

Given a list of words, list of  single letters (might be repeating) and score of every character. Return the maximum score of any valid set of words formed by using the given letters (words[i] cannot be used two or more times). It is not necessary to use all characters in letters and each letter can only be used once. Score of letters 'a', 'b' ...

1. Title Given the root node root and a value key of a binary search tree, delete the node corresponding to the key in the binary search tree and ensure that the nature of the binary search tree remains unchanged. Returns a reference to the root node of a binary search tree that may be updated. Generally speaking, deleting a node can ...

This paper summarizes some basic operations of chained binary tree in class, including Calculate the number of nodes of the binary treeCalculate the number of leaf nodes of binary treeCalculate the number of nodes in the K-th layer of the binary treeCalculate the depth / height of the binary treeFind and return the node with the value of x ...

Construction method of FileOutputStream FileOutputStream Four common construction methods are provided for instantiation FileOutputStream Object, Different scenarios use different construction methods. Scenario 1: use the File object to open a local File and read data from the File. public FileOutputStream(File file) throws FileNotFoundExce ...

This article summarizes the leetcode problem about arrays, and basically finds out the problem-solving ideas and methods of array problems. So that you can quickly find ideas and solutions when you encounter similar problems later. 303. Region and retrieval - array immutable Given an integer array nums, find the sum of the elements in ...