05 2014 档案

LeetCode124:Binary Tree Maximum Path Sum
摘要：题目： Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binary tree, 1 / \ 2 3Return 6. 解题思路：最长路... 阅读全文
posted @ 2014-05-27 18:09 mickole 阅读(579) 评论(0) 推荐(0) 编辑
LeetCode123: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 m... 阅读全文
posted @ 2014-05-27 10:29 mickole 阅读(338) 评论(0) 推荐(0) 编辑
LeetCode122: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... 阅读全文
posted @ 2014-05-26 20:25 mickole 阅读(276) 评论(0) 推荐(0) 编辑
LeetCode121: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 stoc... 阅读全文
posted @ 2014-05-26 20:04 mickole 阅读(371) 评论(0) 推荐(0) 编辑
MyEclipse10修改servlet模版
摘要：Myeclipse10中servlet模版存放的位置与早些的版本不同，它存放在： MyEclipse\Common\plugins中的下面那个jar包中 com.genuitec.eclipse.wizards_9.0.0.me201108091322.jar 不用解压，直接用解压缩工具打开即可，然后在文件夹\templates中就可找到Servlet.java. 阅读全文
posted @ 2014-05-11 09:33 mickole 阅读(320) 评论(0) 推荐(0) 编辑
MyEclipse10启动Tomcat8出错
摘要：问题一： java.lang.UnsupportedClassVersionError: org/apache/catalina/startup/Bootstrap : (Unsupported major.minor version 55.0) 原因是因为jdk版本太低了，tomcat8支持，更换更高级的jdk或者使用低版本的tomcat。 这里我将jdk换成jdk1.8： 但重启t... 阅读全文
posted @ 2014-05-08 21:05 mickole 阅读(3680) 评论(0) 推荐(0) 编辑
Tomcat8访问管理页面localhost出现：403 Access Denied
摘要：问题： 403 Access DeniedYou are not authorized to view this page.If you have already configured the Manager application to allow access and you have used your browsers back button, used a saved book-... 阅读全文
posted @ 2014-05-07 22:56 mickole 阅读(5615) 评论(1) 推荐(1) 编辑
LeetCode5：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 longest palindromic substring. 解题思路： 主要有三种： 第一种：... 阅读全文
posted @ 2014-05-01 13:22 mickole 阅读(334) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示