733. Flood Fill

An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image.

Algorithem_Depth-First Search

3. Longest Substring Without Repeating Characters

Given a string s, find the length of the longest substring without repeating characters.

Algorithem_TwoPointersOfLinked List

876. Middle of the Linked List

Given the head of a singly linked list, return the middle node of the linked list.

If there are two middle nodes, return the second middle node.

Algorithem_ReverseWords

Reverse Words in a String III

Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Algorithem_TwoPointers

Two Sum II - Input Array Is Sorted

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.

Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.

The tests are generated such that there is exactly one solution. You may not use the same element twice.

Your solution must use only constant extra space.

Algorithem_MoveZeros

Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Algorithem_ReverseArray

Given an array, rotate the array to the right by k steps, where k is non-negative.

Algorithem_Sort

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

Algorithem_BinarySearch

BinarySearch

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.

我住在上海青浦，想记录一下这次的经历。从来没想过有一天需要担心的事情：今天吃什么，家里东西够不够，今天哪里能买到菜。

由于公司在浦东，浦东街道分批排查疫情的缘故，03🈷24号开始居家办公，并没有感觉到疫情对青浦这边的影响。而后的突然通知公司里有个无症状感染者，虽然和我不在同一楼层，但公司受到影响，所以仍继续居家办公，彼时只是稍微感觉有些紧迫，但并未太在意。再接下来，就是收到浦东4天（2022年03月28日——2022年04月01日）、浦西4天（2022年04月01日——2022年04月05日）的通知，这时还在感叹终于舍得封闭了，由于还是居家办公，所以打算等浦西封闭前一天去买菜。

但是