博客园 - mickoleuuid:24b78886-0ed1-41c2-8670-e3f31dcf42c4;id=1721922014-07-20T00:41:37Zmickolehttps://www.cnblogs.com/mickole/feed.cnblogs.comhttps://www.cnblogs.com/mickole/p/3755631.htmlLeetCode124:Binary Tree Maximum Path Sum - mickole题目: 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. 解题思路:最长路...2014-05-27T10:09:00Z2014-05-27T10:09:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: 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. 解题思路:最长路... <a href="https://www.cnblogs.com/mickole/p/3755631.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3754576.htmlLeetCode123:Best Time to Buy and Sell Stock III - mickole题目: 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...2014-05-27T02:29:00Z2014-05-27T02:29:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: 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... <a href="https://www.cnblogs.com/mickole/p/3754576.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3753820.htmlLeetCode122:Best Time to Buy and Sell Stock II - mickole题目: 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...2014-05-26T12:25:00Z2014-05-26T12:25:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: 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... <a href="https://www.cnblogs.com/mickole/p/3753820.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3753802.htmlLeetCode121:Best Time to Buy and Sell Stock - mickole题目: 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...2014-05-26T12:04:00Z2014-05-26T12:04:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: 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... <a href="https://www.cnblogs.com/mickole/p/3753802.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3721375.htmlMyEclipse10修改servlet模版 - mickoleMyeclipse10中servlet模版存放的位置与早些的版本不同,它存放在: MyEclipse\Common\plugins中的下面那个jar包中 com.genuitec.eclipse.wizards_9.0.0.me201108091322.jar 不用解压,直接用解压缩工具打开即可,然后在文件夹\templates中就可找到Servlet.java.2014-05-11T01:33:00Z2014-05-11T01:33:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】Myeclipse10中servlet模版存放的位置与早些的版本不同,它存放在: MyEclipse\Common\plugins中的下面那个jar包中 com.genuitec.eclipse.wizards_9.0.0.me201108091322.jar 不用解压,直接用解压缩工具打开即可,然后在文件夹\templates中就可找到Servlet.java. <a href="https://www.cnblogs.com/mickole/p/3721375.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3717645.htmlMyEclipse10启动Tomcat8出错 - mickole问题一: java.lang.UnsupportedClassVersionError: org/apache/catalina/startup/Bootstrap : (Unsupported major.minor version 55.0) 原因是因为jdk版本太低了,tomcat8支持,更换更高级的jdk或者使用低版本的tomcat。 这里我将jdk换成jdk1.8: 但重启t...2014-05-08T13:05:00Z2014-05-08T13:05:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】问题一: java.lang.UnsupportedClassVersionError: org/apache/catalina/startup/Bootstrap : (Unsupported major.minor version 55.0) 原因是因为jdk版本太低了,tomcat8支持,更换更高级的jdk或者使用低版本的tomcat。 这里我将jdk换成jdk1.8: 但重启t... <a href="https://www.cnblogs.com/mickole/p/3717645.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3714973.htmlTomcat8访问管理页面localhost出现:403 Access Denied - mickole问题: 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-...2014-05-07T14:56:00Z2014-05-07T14:56:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】问题: 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-... <a href="https://www.cnblogs.com/mickole/p/3714973.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3702747.htmlLeetCode5:Longest Palindromic Substring - mickole题目: 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. 解题思路: 主要有三种: 第一种:...2014-05-01T05:22:00Z2014-05-01T05:22:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: 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. 解题思路: 主要有三种: 第一种:... <a href="https://www.cnblogs.com/mickole/p/3702747.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3699093.htmlLeetCode4:Add Two Numbers - mickole题目: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a...2014-04-29T06:07:00Z2014-04-29T06:07:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a... <a href="https://www.cnblogs.com/mickole/p/3699093.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3698956.htmlLeetCode3:Longest Substring Without Repeating Characters - mickole题目: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3....2014-04-29T04:27:00Z2014-04-29T04:27:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3.... <a href="https://www.cnblogs.com/mickole/p/3698956.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3698650.htmlLeetCode2:Median of Two Sorted Arrays - mickole题目: There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 解题思路: 这道题,很容易想到的是先排序再直接定位中间那个...2014-04-29T02:26:00Z2014-04-29T02:26:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 解题思路: 这道题,很容易想到的是先排序再直接定位中间那个... <a href="https://www.cnblogs.com/mickole/p/3698650.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3695894.htmlLeetCode1:Two Sum - mickole题目: Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, ...2014-04-28T02:53:00Z2014-04-28T02:53:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, ... <a href="https://www.cnblogs.com/mickole/p/3695894.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3695712.htmlLeetCode127:Word Ladder II - mickole题目: Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: Only one letter can be changed at a time Each intermediate word m...2014-04-28T01:41:00Z2014-04-28T01:41:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: Only one letter can be changed at a time Each intermediate word m... <a href="https://www.cnblogs.com/mickole/p/3695712.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3694896.htmlLeetCode126:Word Ladder - mickole题目: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a time Each intermed...2014-04-27T09:15:00Z2014-04-27T09:15:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a time Each intermed... <a href="https://www.cnblogs.com/mickole/p/3694896.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3689413.htmlLeetCode128:Longest Consecutive Sequence - mickole题目: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [...2014-04-25T10:50:00Z2014-04-25T10:50:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [... <a href="https://www.cnblogs.com/mickole/p/3689413.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3687649.htmlLeetCode129:Sum Root to Leaf Numbers - mickole题目: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the total...2014-04-24T15:16:00Z2014-04-24T15:16:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the total... <a href="https://www.cnblogs.com/mickole/p/3687649.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3687516.htmlLeetCode130:Surrounded Regions - mickole题目: Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, X X X XX O O XX X O ...2014-04-24T14:28:00Z2014-04-24T14:28:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, X X X XX O O XX X O ... <a href="https://www.cnblogs.com/mickole/p/3687516.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3687335.htmlLeetCode132:Palindrome Partitioning II - mickole题目: Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab", Ret...2014-04-24T12:48:00Z2014-04-24T12:48:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab", Ret... <a href="https://www.cnblogs.com/mickole/p/3687335.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3683271.htmlLeetCode131:Palindrome Partitioning - mickole题目: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return [ ["aa...2014-04-23T08:54:00Z2014-04-23T08:54:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】题目: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return [ ["aa... <a href="https://www.cnblogs.com/mickole/p/3683271.html" target="_blank">阅读全文</a>https://www.cnblogs.com/mickole/p/3654414.html2014腾讯实习生招聘武汉试题 - mickole注:以上图片来自网络,非常感谢拍照者提供附最后一提实现代码:#include#include#includeusing namespace std;int MaxArea(int *arr, int len){ if(arr == NULL || len > my_stack;//存放每个元...2014-04-09T08:04:00Z2014-04-09T08:04:00Zmickolehttps://www.cnblogs.com/mickole/【摘要】注:以上图片来自网络,非常感谢拍照者提供附最后一提实现代码:#include#include#includeusing namespace std;int MaxArea(int *arr, int len){ if(arr == NULL || len > my_stack;//存放每个元... <a href="https://www.cnblogs.com/mickole/p/3654414.html" target="_blank">阅读全文</a>