Programmer Think

catalogue 1, Foreword 2, Title Description ① Students who want to practice English can read this question carefully to see if they can understand the question. What do you want us to do! ② The following is the input and output of the sample (read the question carefully! There is an implication) ​ 3, Topic interpretation 4, Train of thoug ...

Daily question 611: judge whether it is a triangle My inherent impression is to use violence to solve, then timeout, and then sort the array and recalculate. It is passed, but it takes too long. class Solution { public int triangleNumber(int[] nums) { int n = nums.length; if(n<3) return 0; int count = 0; ...

Solution to the 273rd weekly game of Leetcode (C + + version) Problem A - Number reversed twice meaning of the title Ask whether a number reversed twice is equal to the original number thinking Only the last 0 matches the number 0 code class Solution { public: bool isSameAfterReversals(int num) { return (num%10||num==0); } }; ...

116. Populate the next right node pointer for each node Meaning: Given a perfect binary tree, all leaf nodes are in the same layer, and each parent node has two child nodes. Binary tree is defined as follows: struct Node { int val; Node *left; Node *right; Node *next; } Fill in each of its next pointers so that this pointer po ...

Understanding of dijestra algorithm Today, do a single source longest path problem leetcode-743 , although I immediately thought of dijestra algorithm, I became a little vague about its specific idea, so I reviewed this classic algorithm with this problem. Overview of dijestra algorithm Dijkstra algorithm was proposed by Dutch computer scient ...

Topic source 416. Segmentation and subsets Title details Give you a non empty array containing only positive integers, {nums. Please judge whether this array can be divided into two subsets so that the sum of the elements in the two subsets is equal. Example 1: Input: num = [1,5,11,5] Output: true Explanation: an array can be divided into [1, 5 ...

1, Title [LeetCode-242] Given two strings s and t, write a function to determine whether t is an alphabetic ectopic word of s. Note: if each character in ， s and t ， occurs the same number of times, then ， s and t ， are called alphabetic words. Example 1: Input: s = "anagram", t = "nagaram" Output: true Exa ...

1, Title Requirements Alice and Bob play a game in turn. Alice takes the lead. There are n stones in a pile of stones. When it's a player's turn, he can remove a stone and get the value of the stone. Alice and Bob have different criteria for the value of stones. Both sides know each other's criteria.Give you two integer arrays of length n, ali ...

preface This topic is the top 100 high frequency questions of LeetCode Our community will gradually organize the Swift Algorithm Solutions of Gu Yi (Netflix growth hacker, author of iOS interview, ACE professional fitness coach. Microblog: @ Taoist Gu Yin) into text versions to facilitate everyone's learning and reading. So far, we have upda ...

▄█▔▉● Bisection template Template 1 int BinarySearch1(vector<int>& nums, int target) { int l = 0, r = nums.size() - 1; while (l <= r) {// int mid = l + (r - l) / 2; if (nums[mid] == target) {// return mid; } else if (nums[mid] > target) { r = mid - 1; } else { l = mid + 1; } } return -1; } Templat ...