【LeetCode】87. Insertion Sort List
题目描述(Medium)
Sort a linked list using insertion sort.
A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.
With each iterati...
【LeetCode】88. Sort List
题目描述(Medium)
Sort a linked list in O(n log n) time using constant space complexity.
题目链接
https://leetcode.com/problems/sort-list/description/
Example 1:
Input: 4->2->1->3
Output: 1->...
【LeetCode】89. First Missing Positive
题目描述(Hard)
Given an unsorted integer array, find the smallest missing positive integer.
题目链接
https://leetcode.com/problems/first-missing-positive/description/
Example 1:
Input: [1,2,0]
Output: 3...
【LeetCode】90. Sort Colors
题目描述(Medium)
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we w...
【LeetCode】91. Search for a Range
题目描述(Easy)
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm's runtime complexity must be in the order ofO(log n).
If the target is not...
【LeetCode】92. Search Insert Position
题目描述(Easy)
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in ...
【LeetCode】93. Search a 2D Matrix
题目描述(Medium)
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Integers in each row are sorted from left to right.
The first integ...
【LeetCode】94. Subsets
题目描述(Medium)
Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
题目链接
https://leetcode.com/problems/subs...
【LeetCode】95. Subsets II
题目描述(Medium)
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
题目链接
https:...
【LeetCode】96. Permutations
题目描述(Medium)
Given a collection of distinct integers, return all possible permutations.
题目链接
https://leetcode.com/problems/permutations/description/
Example 1:
Input: [1,2,3]
Output:
[
[1,2,3]...
【LeetCode】97. Permutations II
题目描述(Medium)
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
题目链接
https://leetcode.com/problems/permutations-ii/description/
Example 1:
Inpu...
【LeetCode】98. Combinations
题目描述(Medium)
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
题目链接
https://leetcode.com/problems/combinations/description/
Example 1:
Input: n = 4, k = 2...
【LeetCode】99. Letter Combinations of a Phone Number
题目描述(Medium)
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone b...
一文盘点直播技术中的编解码、直播协议、网络传输与简单实现
本文节选自 Live CheatSheet | 直播技术理论基础与实践概论，很多内容非作者原创，而是对 Live Links 中列举出的多篇文章的盘点总结，更多直播相关内容可以前往 xCompass 交互式检索或 MushiChat 查看代码。 Live
网络操作系统课后题（第三章）
1.试对程序、进程、线程的概念和功能进行比较。 （1）进程的概念： 关于进程，有很多定义，例如： 1）进程是程序的一次执行； 2）进程是可以和别的进程并发执行的计算； 3）进程就是一个程序在给定活动空间和初始条件下，在一个处理机上的执行进程； 4）进程是程序在一个数据集合上的运行过程，它是系统进行资源分配和调度的一个独立单位； 5）进程是动态的，有生命周期的活动。内核可以创建一个进程，最终将由内核终止该进程使其消亡； 总的来说，进程是在自身的虚拟地址空间运行的一个单独的程序。 （2）进程与程序
今日推荐
周排行