m0_54964586的博客

目录题目描述题目大意解题方法方法一：并查集题目描述There are n computers numbered from 0 to n-1 connected by ethernet cables connections forming a network where connections[i] = [a, b] represents a connection between computers a and b. Any computer can reach any other computer di

目录题目描述题目大意解题方法方法一：并查集题目描述There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly with city c, then city a is connected indirectly with city c.A province is a group

目录题目描述题目大意解题方法方法一：并查集题目描述You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows ×\times× columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and

目录题目描述题目大意解题方法方法一：前缀和题目描述Given an array of integers nums, write a method that returns the “pivot” index of this array.We define the pivot index as the index where the sum of all the numbers to the left of the index is equal to the sum of all the numbers

目录题目描述题目大意解题方法方法一：排序+双指针方法二：计数题目描述Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a == c and b == d), or (a == d) - that is, one domino can be rotated to be equal to another domino.Return the n