Programmer Think

Day 34 540 a single element in an ordered array Give you an ordered array of integers, where each element will appear twice and only one number will appear once. Please find and return the number that appears only once. The solution you design must meet O(log n) time complexity and O(1) space complexity. method Since all elements in the a ...

1. Longest substring without repeated characters ① Violent solution According to the topic, convert the string to char type, cycle once, and then use a temp variable of temporary StringBuffer type for judgment. If the current byte does not exist in the temp string, it will be traced. Otherwise, it will be intercepted, and then continue to run ...

Template Title Link BST Lookup- Leetcode 270. Closest BST ValueBST Insert- Leetcode 701. Insert Node in BSTBST Delete- Leetcode 450. Delete Node in BST Binary Search Tree-BST Overview BST is a kind of binary tree, which has the structural properties of binary tree: there is only one Root node, each node can have at most two left and right sub ...

⭐ New pit in winter vacation -- daily question notes of code Fox 😢 The winter vacation is about to expire 😢 6007. Maximum sum of array - Hard - game 280 weekly question 4 Give you an integer array nums with length N and an integer numSlots, satisfying 2 * numSlots > = n. There are a total of numSlots baskets numbered 1 to numSlots. Y ...

Address: Force bucklehttps://leetcode-cn.com/problems/score-after-flipping-matrix/ Title: There is A two-dimensional matrix ， A, where the value of each element is ， 0 ， or ， 1. Move refers to selecting any row or column and converting each value in the row or column: change all 0 to 1 and all 1 to 0. After making any number of moves, ...

overview LeetCode Hot: middle order traversal of binary tree, different binary search trees, verification binary search tree, symmetric binary tree, sequence traversal of binary tree Android framework: establish connection and connection pool LeetCode Hot 2.36 middle order traversal of binary tree Given the root node of a binary tree, r ...

The two players play the role of cat and mouse respectively, and play the game on an undirected graph. They take turns. The form of graph is: graph[a] is a list, which is composed of all nodes b satisfying that ab is an edge in the graph. The mouse starts from node 1 and starts first; The cat starts from node 2 and starts the second. There is ...

Say something before brushing If you want to cut the length of the article, you will say it in addition to the length of the code, Because too much time is wasted in writing articles! In fact, it's not difficult to brush the questions. What's difficult is to insist! This column is the classic title of sword finger offer, And record you ...

Summary of dynamic programming of leetcode 3 1 - house raiding Title Link: Title Link stamp here!!! Idea: the idea of this question is not difficult, but we need to pay attention to the details. Recurrence formula: DP [i] = max (DP [I-1], DP [I-2] + num [i]) class Solution { public int rob(int[] nums) { if(nums.length==1){ ...

1, Title Requirements Given a two-dimensional binary matrix containing only 0 and 1 and the size of rows x cols, find the largest rectangle containing only 1 and return its area.Example 1: Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]] Output: 6 Example 2: Input: matrix = [] Outp ...