03 2018 档案

Lintcode362 Sliding Window Maximum solution 题解
摘要：【题目描述】 Given an array of n integer with duplicate number, and a moving window(size k), move the window at each iteration from the start of the array, 阅读全文
posted @ 2018-03-27 23:16 锖青磁 阅读(97) 评论(0) 推荐(0) 编辑
Lintcode363 Trapping Rain Water solution 题解
摘要：【题目描述】 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 r 阅读全文
posted @ 2018-03-27 23:15 锖青磁 阅读(131) 评论(0) 推荐(0) 编辑
Lintcode364 Trapping Rain Water II solution 题解
摘要：【题目描述】 Given n x m non-negative integers representing an elevation map 2d where the area of each cell is 1x1, compute how much water it is able to tra 阅读全文
posted @ 2018-03-27 23:14 锖青磁 阅读(131) 评论(0) 推荐(0) 编辑
Lintcode366 Fibonacci solution 题解
摘要：【题目描述】 Find the Nth number in Fibonacci sequence. A Fibonacci sequence is defined as follow: The first two numbers are 0 and 1. The ith number is the 阅读全文
posted @ 2018-03-27 23:13 锖青磁 阅读(96) 评论(0) 推荐(0) 编辑
Lintcode365 Count 1 in Binary solution 题解
摘要：【题目描述】 Count how many 1 in binary representation of a 32-bit integer. 计算在一个 32 位的整数的二进制表示中有多少个1. 【题目链接】 www.lintcode.com/en/problem/count-1-in-binary/ 阅读全文
posted @ 2018-03-27 23:10 锖青磁 阅读(139) 评论(0) 推荐(0) 编辑