北叶青藤

2016年7月15日

摘要： Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to 阅读全文

posted @ 2016-07-15 05:15 北叶青藤阅读(172) 评论(0) 推荐(0)

Wood Cut

摘要： Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the s 阅读全文

posted @ 2016-07-15 03:39 北叶青藤阅读(255) 评论(0) 推荐(0)

Gas Station

摘要： There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost 阅读全文

posted @ 2016-07-15 02:06 北叶青藤阅读(282) 评论(0) 推荐(0)

2016年7月14日

Longest Palindromic Substring

摘要： Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes 阅读全文

posted @ 2016-07-14 21:58 北叶青藤阅读(151) 评论(0) 推荐(0)

Interval Minimum Number

摘要： Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers [start, end]. For each 阅读全文

posted @ 2016-07-14 21:35 北叶青藤阅读(234) 评论(0) 推荐(0)

Count of Smaller Number before itself

摘要： Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) . For each element Ai in the array, count th 阅读全文

posted @ 2016-07-14 21:16 北叶青藤阅读(366) 评论(0) 推荐(0)

42. Trapping Rain Water I && II

摘要： 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. 阅读全文

posted @ 2016-07-14 09:02 北叶青藤阅读(245) 评论(0) 推荐(0)

Container With Most Water

摘要： Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endp 阅读全文

posted @ 2016-07-14 08:50 北叶青藤阅读(163) 评论(0) 推荐(0)

Count 1 in Binary

摘要： Count how many 1 in binary representation of a 32-bit integer. Count how many 1 in binary representation of a 32-bit integer. Count how many 1 in bina 阅读全文

posted @ 2016-07-14 08:30 北叶青藤阅读(165) 评论(0) 推荐(0)

Interval Sum I && II

摘要： Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers [start, end]. For each 阅读全文

posted @ 2016-07-14 04:26 北叶青藤阅读(252) 评论(0) 推荐(0)

公告