2018年03月_konsy_dong

11月 10月 07月 06月 05月 04月 03月 02月 01月

转载操作系统时间片轮转调度算法

转自https://blog.csdn.net/u013630349/article/details/47732731时间片轮转法（RR）算法描述：用于分时系统中的进程调度。每次调度时，总是选择就绪队列的队首进程，让其在CPU上运行一个系统预先设置好的时间片。一个时间片内没有完成运行的进程，返回到绪队列末尾重新排队，等待下一次调度。【例】进程A、B、C、D需要运行的时间分别为20ms、...

2018-03-29 16:51:29 70316 8

原创 LeetCode 669. Trim a Binary Search Tree

题目： Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so t...

2018-03-29 03:31:11 191

原创 LeetCode 617. Merge Two Binary Trees

题目： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary...

2018-03-28 16:17:02 240

转载 CPU-bound(计算密集型) 和I/O bound(I/O密集型)

转自http://blog.chinaunix.net/space.php?uid=13714918&do=blog&id=2875404 I/O密集型 (CPU-bound) I/O bound 指的是系统的CPU效能相对硬盘/内存的效能要好很多，此时，系统运作，大部分的状况是 CPU 在等 I/O (硬盘/内存) 的读/写，此时 CPU Loading 不高。 CPU ...

2018-03-27 15:25:45 775

原创 LeetCode 696. Count Binary Substrings

题目： Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0’s and 1’s, and all the 0’s and all the 1’s in these substrings are grouped consecutively.Su...

2018-03-26 16:56:22 209

原创 LeetCode 788. Rotated Digits

题目： X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotated - we cannot choose to leave it alone.A n...

2018-03-26 15:36:30 255

原创 LeetCode 338. Counting Bits

题目： Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example: For num = ...

2018-03-23 02:12:59 221

原创 LeetCode 746. Min Cost Climbing Stairs

题目： On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the to...

2018-03-23 00:35:20 164

原创 LeetCode 717. 1-bit and 2-bit Characters

题目： We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).Now given a string represented by several bit...

2018-03-20 16:55:19 175

原创 LeetCode 695. Max Area of Island

题目： Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are s...

2018-03-20 16:25:32 174

原创 LeetCode 766. Toeplitz Matrix

题目： A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.Now given an M x N matrix, return True if and only if the matrix is Toeplitz.Example 1: Input: ma...

2018-03-19 22:22:25 176