随笔分类 -  Lintcode

Lintcode372 Delete Node in the Middle of Singly Linked List solution 题解
摘要：【题目描述】 Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. 给定一个单链表中的一个等待被删除的节点(非表头或表尾)。请在在O 阅读全文
posted @ 2018-04-07 09:42 锖青磁 阅读(109) 评论(0) 推荐(0)
Lintcode371 Print Numbers by Recursion solution 题解
摘要：【题目描述】 Print numbers from 1 to the largest number with N digits by recursion. Notice It's pretty easy to do recursion like: recursion(i) { if i > larg 阅读全文
posted @ 2018-04-06 10:55 锖青磁 阅读(80) 评论(0) 推荐(0)
Lintcode370 Convert Expression to Reverse Polish Notation solution 题解
摘要：【题目描述】 Given an expression string array, return the Reverse Polish notation of this expression. (remove the parentheses) 给定一个表达式字符串数组，返回该表达式的逆波兰表达式（即去 阅读全文
posted @ 2018-04-05 13:58 锖青磁 阅读(86) 评论(0) 推荐(0)
Lintcode368 Expression Evaluation solution 题解
摘要：【题目描述】 Given an expression string array, return the final result of this expression Notice：The expression contains only integer,+,-,*,/,(,). 给一个用字符串表示 阅读全文
posted @ 2018-04-04 19:13 锖青磁 阅读(119) 评论(0) 推荐(0)
Lintcode367 Expression Tree Build solution 题解
摘要：【题目描述】 The structure of Expression Tree is a binary tree to evaluate certain expressions. All leaves of the Expression Tree have an number string valu 阅读全文
posted @ 2018-04-02 14:00 锖青磁 阅读(94) 评论(0) 推荐(0)
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 锖青磁 阅读(104) 评论(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 锖青磁 阅读(137) 评论(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 锖青磁 阅读(142) 评论(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 锖青磁 阅读(112) 评论(0) 推荐(0)