- 博客(7)
- 收藏
- 关注
RSS订阅原创 42. Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]
2016-10-22 21:31:49
182
原创 48. Rotate Image
You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 将矩阵旋转90度，要求要在原矩阵进行。我的实现是从外围向内，循环处理每个“边框”。观察一下
2016-10-20 15:45:33
121
原创 4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: nums1 =
2016-10-13 17:24:11
370
转载 int 10h中断例程
转自汇编--INT 10H功能 INT 10H 是由 BIOS 对屏幕及显示器所提供的服务程序，而后倚天公司针对倚天中文提供了许多服务程序，这些服务程序也加挂在 INT 10H 内。使用 INT 10H 中断服务程序时，先指定 AH 寄存器为下表编号其中之一，该编号表示欲调用的功用，而其他寄存器的详细说明，参考表后文字，当一切设定好之后再调用 INT 10H。底下是它们的说明：
2016-10-13 10:08:31
1237
原创 123. Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not
2016-10-08 19:24:25
323
原创 122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on
2016-10-08 16:57:08
226
原创 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
2016-10-08 16:15:33
188
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人