<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[jerseyma的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/jerseyma</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jerseyma]]></copyright><item><title><![CDATA[如何在windows7操作系统下搭建用于开发网站的web服务器环境]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48652713</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48652713</guid><author>jerseyma</author><pubDate>Tue, 22 Sep 2015 12:45:10 +0800</pubDate><description><![CDATA[相信很多人和我一样，都想过搭建一个自己的web服务器，设计一个网站，好让别人来访问。  
怎么在windows下实现呢？方法其实非常简单，你既不需要任何特别的操作系统，也不需要租用别人的服务器，你自己的计算机就可以实现你要的功能。 怎么实现呢？互联网上最经典的网站架构叫做LAMP，指的是Linux, Apache, MySQL 以及 PHP，既然我们的计算机不是Linux操作系统，那就稍作改变，改为]]></description><category></category></item><item><title><![CDATA[如何在Windows7操作系统下使用g++命令]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48215897</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48215897</guid><author>jerseyma</author><pubDate>Fri, 04 Sep 2015 23:46:42 +0800</pubDate><description><![CDATA[Windows下使用CMD，可以像Linux下一样使用g++命令配置的方法很简单 
1. 去MinGW的官网下载MinGW，这是C++的编译器  
http://www.mingw.org/  
2. 将默认工具安装在默认地址，记下bin文件夹所在地址  
3. 类似于配置JDK，将C++的bin文件夹所在地址添加到PATH路径  
computer -> properties -> Advance]]></description><category></category></item><item><title><![CDATA[如何在Windows7操作系统下安装用于C++开发的Eclipse]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48188381</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48188381</guid><author>jerseyma</author><pubDate>Thu, 03 Sep 2015 01:07:04 +0800</pubDate><description><![CDATA[在windows下开发C++程序，我用过的最多的环境是Dev-C++。 
Dev-C++很简洁，安装简单，直接去官网下载安装到C盘即可。Eclipse相对于Dev-C++而言是一款功能更加强大的开发环境，它的安装要更多的步骤。
配置JDK 
1.1 下载JDK，安装，并记录下安装位置，找到bin文件夹所在地 
http://www.oracle.com/technetwork/java/javase]]></description><category></category></item><item><title><![CDATA[[Tree]Family]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173549</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173549</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:19:11 +0800</pubDate><description><![CDATA[//Created: July 2nd, 2015 Thu
//Last Modified: July 5th, 2015 Sun
//A Non-Linear Data Structure - Tree
//Note: On July 3rd, 2015. Initially I designed this Tree in this way, that only children know the]]></description><category></category></item><item><title><![CDATA[[Linked_List]Book]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173543</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173543</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:18:37 +0800</pubDate><description><![CDATA[//Created: May 26th, 2015
//Last Modified: July 2nd, 2015 Tue
//Linear List "BookList", implemented in Linked List (1-way)
//Linear List "BookArray", implemented in Dynamic Array
//Note: On June 29th,]]></description><category></category></item><item><title><![CDATA[[Leetcode]#258 Add Digits]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173531</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173531</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:13:59 +0800</pubDate><description><![CDATA[//#258 Add Digits
//28ms unknown distribution
class Solution {
public:
    int addDigits(int num) 
    {
        while(num > 9)
        {
            vector<int> digits = pushVector(num);
            n]]></description><category></category></item><item><title><![CDATA[[Leetcode]#237 Delete Node in a Linked List]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173527</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173527</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:12:38 +0800</pubDate><description><![CDATA[//#237 Delete Node in a Linked List
//20ms 8.09%
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 *]]></description><category></category></item><item><title><![CDATA[[Leetcode]#234 Palindrome Linked List]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173525</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173525</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:11:16 +0800</pubDate><description><![CDATA[//#234 Palindrome Linked List
//32ms 14.13%
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 *]]></description><category></category></item><item><title><![CDATA[[Leetcode]#231 Power of Two]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173521</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173521</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:09:10 +0800</pubDate><description><![CDATA[//#231 Power of Two
//8ms 98.07%
class Solution {
public:
    bool isPowerOfTwo(int n) 
    {
        int m = n & (n-1);
        return ( (n > 0) && (m == 0) );
    }
};]]></description><category></category></item><item><title><![CDATA[[Leetcode]#228 Summary Ranges]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173517</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173517</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:06:48 +0800</pubDate><description><![CDATA[//#228 Summary Ranges
//0ms 100%
class Solution {
public:
    void int_string(string& s, int num)
    {
        if(num < 0)
        {
            s.push_back('-');
        }
        int size = s.size()]]></description><category></category></item><item><title><![CDATA[[Leetcode]#223 Rectangle Area]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173513</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173513</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:04:42 +0800</pubDate><description><![CDATA[//#223 Rectangle Area
//32ms 98.98%
class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) 
    {
        int c1(0), c2(0), c3(0), c4(0);
        if(A>=E)]]></description><category></category></item><item><title><![CDATA[[Leetcode]#219 Contains Duplicate II]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173511</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173511</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:03:37 +0800</pubDate><description><![CDATA[//#219 Contains Duplicate II
//76ms 12.69%
#include <iostream>
#include <vector>
#include <set>
#include <map>
using namespace std;class Solution {
public:
    bool containsNearbyDuplicate(vector<int>&]]></description><category></category></item><item><title><![CDATA[[Leetcode]#217 Contains Duplicate]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173503</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173503</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 08:00:57 +0800</pubDate><description><![CDATA[//#217 Contains Duplicate
//88ms 27.67%
#include <iostream>
#include <vector>
#include <set>
using namespace std;class Solution {
public:
    bool containsDuplicate(vector<int>& nums) 
    {
        se]]></description><category></category></item><item><title><![CDATA[[Leetcode]#206 Reverse Linked List]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173495</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173495</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:59:45 +0800</pubDate><description><![CDATA[//#206 Reverse Linked List
//8ms 100%
#include <iostream>
using namespace std;class Solution 
{
public:
    ListNode* reverseList(ListNode* head) 
    {
        ListNode *previous_p, *current_p, *next_]]></description><category></category></item><item><title><![CDATA[[Leetcode]#203 Remove Linked List Elements]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173493</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173493</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:58:42 +0800</pubDate><description><![CDATA[//#203 Remove Linked List Elements
//36ms 67.75%
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 *]]></description><category></category></item><item><title><![CDATA[[Leetcode]#202 Happy Number]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173489</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173489</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:57:11 +0800</pubDate><description><![CDATA[//#202 Happy Number
//640ms 0%
class Solution {
public:
    int addHappyVector(vector<int> v)
    {
        int sum(0);
        for(unsigned int i=0; i<v.size(); i++)
        {
            sum = sum +]]></description><category></category></item><item><title><![CDATA[[Leetcode]#189 Rotate Array]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173487</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173487</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:55:56 +0800</pubDate><description><![CDATA[//#189 Rotate Array
//24ms 100%
class Solution {
public:
    void rotate(vector<int>& nums, int k) 
    {
        if(nums.size() == 0 || nums.size() == 1) return;
        k = k % nums.size();
        i]]></description><category></category></item><item><title><![CDATA[[Leetcode]#171 Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173485</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173485</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:54:44 +0800</pubDate><description><![CDATA[//#171 Excel Sheet Column Number
//8ms 100%
class Solution {
public:
    int titleToNumber(string s) 
    {
        int s_num(0);
        int j(0);
        for(string::reverse_iterator r_it = s.rbegin(]]></description><category></category></item><item><title><![CDATA[[Leetcode]#169 Majority Element]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173483</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173483</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:53:36 +0800</pubDate><description><![CDATA[//#169 Majority Element
//20ms 88.35%
class Solution {
public:
    int majorityElement(vector<int>& nums) 
    {
        int x(0), m(0);
        for(unsigned int i=0; i<nums.size(); i++)
        {]]></description><category></category></item><item><title><![CDATA[[Leetcode]#168 Excel Sheet Column Title]]></title><link>https://blog.youkuaiyun.com/jerseyma/article/details/48173481</link><guid>https://blog.youkuaiyun.com/jerseyma/article/details/48173481</guid><author>jerseyma</author><pubDate>Wed, 02 Sep 2015 07:52:15 +0800</pubDate><description><![CDATA[//#168 Excel Sheet Column Title
//0ms 100%
class Solution {
public:
    string convertToTitle(int n) 
    {
        string result;
        int remainder(0);
        while(n!=0)
        {
            re]]></description><category></category></item></channel></rss>