2018年1月
Search for a Range
摘要： Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
posted @ 2018-01-15 14:46 binryang 阅读(117) 评论(0) 推荐(0)
Search in Rotated Sorted Array
摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
posted @ 2018-01-05 22:07 binryang 阅读(97) 评论(0) 推荐(0)
2017年12月
maven创建的项目 SpringMVC无法调用jstl
摘要： SpringMVC使用不了jstl的原因： jstl的包导入错误 maven构建项目的时候自动创建了web.xml 应改为 碰到了第二种情况百度后发现类似情况原帖在 "http://blog.csdn.net/lemo_t/article/details/50518948" 阅读全文
posted @ 2017-12-27 10:27 binryang 阅读(440) 评论(0) 推荐(0)
Next Permutation
摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2017-12-25 15:23 binryang 阅读(97) 评论(0) 推荐(0)
SpringMVC配置信息
摘要： SpringMVC框架图 映射器： BeanNameUrlHandlerMapping(映射器) 对应的Bean SimpleUrlHandlerMapping(） 对应的Bean 适配器 SimpleControllerHandlerAdapter(Controller需要implements C 阅读全文
posted @ 2017-12-21 20:14 binryang 阅读(174) 评论(0) 推荐(0)
Servlet详解（转载）
摘要： Servlet结构图 Servlet接口 具有5个方法 void init(ServletConfig config) throws ServletException: 由Servlet容器控制，初始化Servlet，并只调用一次 void service(ServletRequest req,Se 阅读全文
posted @ 2017-12-12 14:31 binryang 阅读(211) 评论(0) 推荐(0)
Length of Last Word
摘要： Given a string s consists of upper/lower case alphabets and empty space characters ' ', return the length of last word in the string. If the last word 阅读全文
posted @ 2017-12-01 15:38 binryang 阅读(97) 评论(0) 推荐(0)
2017年11月
Maximum Subarray**
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [ 2,1, 3,4, 1,2, 阅读全文
posted @ 2017-11-29 11:06 binryang 阅读(106) 评论(0) 推荐(0)
Divide Two Integers
摘要： Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. public int divide(int dividend, int di 阅读全文
posted @ 2017-11-22 14:12 binryang 阅读(84) 评论(0) 推荐(0)
Generate Parentheses***
摘要： Given n pairs of parentheses, write a function to generate all combinations of well formed parentheses. For example, given n = 3, a solution set is: [ 阅读全文
posted @ 2017-11-21 20:47 binryang 阅读(95) 评论(0) 推荐(0)