题目 Reverse a singly linked list. 解题思路 头插法 代码 /** * Definition for singly-linked list. * type ListNode struct {…

  There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequ…

  You’re given strings J representing the types of stones that are jewels, and S&nbs…

操作系统 进程与线程 What’s the difference between thread and process?A process is an instance of a computer progr…

描述： Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left…

LinkedIn tag Medium 这道题三刷了都还没自主做出来。问题在于不知道这个题跟节点高度的联系。 我们定义helper function为find the height of the root node. 这…

使用滚动数组法来优化空间复杂度 class Solution(object): def findMaxForm(self, strs, m, n): """ :type strs: List[str] :type m: …

  Given a list of non-overlapping axis-aligned rectangles rects, write a function pic…

Given a string s, partition s such that every substring of the partition is a palindrome. Retur…

链接：https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/ 难度：Easy 题目：674. Longes…

题意：给你两个数组，从两个数组中各选一个数交换位置，新得到的两个数组的元素总和相等。 思路一：先得到两个数组各自的元素总和，进而得到平均值，再遍历元素少的vector，得到每个元素如果交换的话需要从另一个vector中得…

题目 Implement the following operations of a queue using stacks. push(x) — Push element x to the back of q…