<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ivyusing的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ivyusing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ivyusing]]></copyright><item><title><![CDATA[新手超详细记录:Docker for Windows打包制作tomcat镜像并部署java web项目]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/79153017</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/79153017</guid><author>ivyusing</author><pubDate>Wed, 24 Jan 2018 18:45:28 +0800</pubDate><description><![CDATA[项目基本情况

我用的是普通的java web项目，其中采用了struts框架，没有main函数，Makefile实在写不出来，因此spring框架的那种打包docker的方式并不适用。 
 
开发工具用的是MyEclipse10，平常在本地运行的时候就是部署到服务器上，将服务器run起来就可以通过端口和项目名访问，如localhost:8080/demo 




准备工作



1、下载安装D]]></description><category></category></item><item><title><![CDATA[算法概论 第八章课后题8.3]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/73655681</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/73655681</guid><author>ivyusing</author><pubDate>Fri, 23 Jun 2017 19:53:09 +0800</pubDate><description><![CDATA[证明 STINGY SAT 为NP 完全问题]]></description><category></category></item><item><title><![CDATA[算法题——Number of Islands（C++）BFS]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/73556240</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/73556240</guid><author>ivyusing</author><pubDate>Wed, 21 Jun 2017 22:33:21 +0800</pubDate><description><![CDATA[由‘0’和‘1’组成的矩阵，上下左右视为相连，统计独立的'1's有多少块。
**知识储备：** 
BFS广度优先搜索，常常借助queue来实现。]]></description><category></category></item><item><title><![CDATA[算法题——Unique Paths（C++）动态规划]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/73189160</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/73189160</guid><author>ivyusing</author><pubDate>Tue, 13 Jun 2017 18:12:24 +0800</pubDate><description><![CDATA[题目描述：  
从左上角到右下角，每次只能向下或者向右走一步，有多少种走法。
知识储备：
动态规划]]></description><category></category></item><item><title><![CDATA[算法题——Linked List Cycle II（C++）链表中的环]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/72871887</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/72871887</guid><author>ivyusing</author><pubDate>Mon, 05 Jun 2017 21:58:28 +0800</pubDate><description><![CDATA[找出链表中是否有环，若有，返回环开始的结点。解题思路： 
要检测链表是否有环，使用快慢指针，慢指针一次走一个结点，快指针一次走两个结点，若有环，在遍历这个环一次或多次后，两个指针会相遇]]></description><category></category></item><item><title><![CDATA[算法题——Course Schedule（C++）有向图求解BFS]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/72838842</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/72838842</guid><author>ivyusing</author><pubDate>Fri, 02 Jun 2017 00:26:47 +0800</pubDate><description><![CDATA[将课程顺序转换为有向图的形式，该有向图中无环则为true。]]></description><category></category></item><item><title><![CDATA[算法题——Longest Substring Without Repeating Characters（C++）hash思想]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/72676724</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/72676724</guid><author>ivyusing</author><pubDate>Wed, 24 May 2017 15:21:26 +0800</pubDate><description><![CDATA[找最长的不包含重复字符的子字符串]]></description><category></category></item><item><title><![CDATA[算法题——Longest Palindromic Substring（JAVA）DP字符串]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/72520715</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/72520715</guid><author>ivyusing</author><pubDate>Fri, 19 May 2017 11:14:40 +0800</pubDate><description><![CDATA[题目描述： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. 找最长的回文字符串]]></description><category></category></item><item><title><![CDATA[codeblocks-16.01mingw-setup安装仍然cant find compiler executable for GNU GCC Compiler]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/72520500</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/72520500</guid><author>ivyusing</author><pubDate>Fri, 19 May 2017 10:58:35 +0800</pubDate><description><![CDATA[codeblocks-16.01mingw-setup 安装仍然 cant find compiler executable in your configured search paths for GNU GCC Compiler  解决办法]]></description><category></category></item><item><title><![CDATA[算法题——Maximum Gap（JAVA）基数排序]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/71883283</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/71883283</guid><author>ivyusing</author><pubDate>Sat, 13 May 2017 19:53:02 +0800</pubDate><description><![CDATA[求出数组排序后相连两个数之间最大的差值。]]></description><category></category></item><item><title><![CDATA[算法题——Merge k Sorted Lists（JAVA）合并链表]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/71250315</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/71250315</guid><author>ivyusing</author><pubDate>Sat, 06 May 2017 12:08:45 +0800</pubDate><description><![CDATA[合并若干个有序列表]]></description><category></category></item><item><title><![CDATA[算法题——Minimum Absolute Difference in BST（JAVA）二叉搜索树]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/71036276</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/71036276</guid><author>ivyusing</author><pubDate>Sun, 30 Apr 2017 20:38:03 +0800</pubDate><description><![CDATA[对于一颗二叉搜索树，求父节点和子节点绝对值之差的最小值]]></description><category></category></item><item><title><![CDATA[算法题——Ones and Zeroes（JAVA）动态规划]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/70432068</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/70432068</guid><author>ivyusing</author><pubDate>Sat, 22 Apr 2017 13:38:29 +0800</pubDate><description><![CDATA[有一定数量的0和1，组成数组中尽量多的字符串。类似于一个二维的背包动态规划问题。]]></description><category></category></item><item><title><![CDATA[算法题——Sort Colors（JAVA）快排]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/70172257</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/70172257</guid><author>ivyusing</author><pubDate>Fri, 14 Apr 2017 14:56:51 +0800</pubDate><description><![CDATA[题目描述：  
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.快排应用]]></description><category></category></item><item><title><![CDATA[算法题——House Robber（JAVA）]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/69938646</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/69938646</guid><author>ivyusing</author><pubDate>Sun, 09 Apr 2017 22:41:12 +0800</pubDate><description><![CDATA[一个数组，不能取连续的两个值，求可得到和的最大值。]]></description><category></category></item><item><title><![CDATA[算法题——Best Time to Buy and Sell Stock II（JAVA）Greedy]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/68927203</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/68927203</guid><author>ivyusing</author><pubDate>Fri, 31 Mar 2017 17:04:58 +0800</pubDate><description><![CDATA[题目描述：  
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.]]></description><category></category></item><item><title><![CDATA[在MyEclipse上同时部署两个Tomcat服务器]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/67640705</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/67640705</guid><author>ivyusing</author><pubDate>Tue, 28 Mar 2017 19:36:38 +0800</pubDate><description><![CDATA[要在MyEclipse上同时部署两个服务器，最简单的方法是： 
1.下载安装版Tomcat6，直接双击运行安装。 
2.下载安装版Tomcat7，直接双击运行安装。 
（两个不同版本的Tomcat是为了方便在MyEclipse上添加，如果安装同一个版本的服务器，会复杂很多）， 
3.在MyEclipse上添加两个服务器，Windows->Preference->搜索Tomcat。添加到对应版本。]]></description><category></category></item><item><title><![CDATA[算法题——Minimum Depth of Binary Tree（JAVA）]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/66479896</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/66479896</guid><author>ivyusing</author><pubDate>Sun, 26 Mar 2017 21:15:37 +0800</pubDate><description><![CDATA[题目描述：  
Given a binary tree, find its minimum depth. 
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.]]></description><category></category></item><item><title><![CDATA[算法题——Convert Sorted List to Binary Search Tree（JAVA）]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/63439449</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/63439449</guid><author>ivyusing</author><pubDate>Sun, 19 Mar 2017 01:09:40 +0800</pubDate><description><![CDATA[题目描述：  
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.]]></description><category></category></item><item><title><![CDATA[算法题——Find the Duplicate Number（JAVA）]]></title><link>https://blog.youkuaiyun.com/ivyusing/article/details/57586397</link><guid>https://blog.youkuaiyun.com/ivyusing/article/details/57586397</guid><author>ivyusing</author><pubDate>Sun, 26 Feb 2017 23:29:16 +0800</pubDate><description><![CDATA[题目描述：  
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate nu]]></description><category></category></item></channel></rss>