<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[baji9701的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/baji9701</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; baji9701]]></copyright><item><title><![CDATA[LeetCode Notes_#989 Add To Array-Form Integer(Java)]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014479</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014479</guid><author>baji9701</author><pubDate>Wed, 11 Sep 2019 19:02:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#989 Add To Array-Form Integer(Java)LeetCode
Contents
思路1：数组转换为数字再相加遇到的问题思路2：按照每一位的顺序相加思路


  

思路1：数组转换为数字再相加
先把输入的A数组转换为数字,然后加上K,取出结果中的每一位，组成一个List.代码如下：
class Solution {
    p...]]></description><category></category></item><item><title><![CDATA[开源项目管理系统Collabtive搭建及调试]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014475</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014475</guid><author>baji9701</author><pubDate>Tue, 23 Jul 2019 20:25:00 +0800</pubDate><description><![CDATA[开源项目管理系统Collabtive搭建及调试Collabtive项目管理
Contents
环境要求安装步骤遇到的问题参考资料


最近在实验室的服务器上搭建了一个Collabtive项目管理系统，本文记录搭建过程及遇到的问题。


  

环境要求
以下是我的环境，可以成功安装，具体的环境要求可以在collabtive源码文件夹里的README文件里看到。比较简单的办法是直接安装...]]></description><category></category></item><item><title><![CDATA[Nodejs/Jquery/Bootstrap搭建简单的web服务]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014472</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014472</guid><author>baji9701</author><pubDate>Fri, 19 Apr 2019 10:31:00 +0800</pubDate><description><![CDATA[Nodejs/Jquery/Bootstrap搭建简单的web服务Jquery前端BootstrapNodejs
Contents
整体思路跨域访问问题Jquery.post()回调函数不执行问题总结


最近想给毕设加入一个前端界面来调用后台的一些功能，这样展示性更好。我使用BootStrap,Jquery写了一个很简陋的前端界面。服务器端使用Node.js express...]]></description><category></category></item><item><title><![CDATA[搭建区块链浏览器——基于hyperledger fabric 1.0,MySQL容器]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014482</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014482</guid><author>baji9701</author><pubDate>Fri, 12 Apr 2019 11:17:00 +0800</pubDate><description><![CDATA[搭建区块链浏览器——基于hyperledger fabric 1.0,MySQL容器区块链hyperledger fabric浏览器MySQL docker
Contents
环境要求分支选择克隆仓库数据库搭建修改配置文件运行服务附录：我的配置文件


区块链浏览器是hyperledger官方项目，能够可视化的查看区块链的详细信息，包括区块信息/详情，交易信息/详情，节点信息...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#206 Reverse Linked List（C++,Python）]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014483</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014483</guid><author>baji9701</author><pubDate>Thu, 10 Jan 2019 18:39:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#206 Reverse Linked List（C++,Python）LeetCode Linked List
Contents
题目思路思考解答C++Python


  

题目
Reverse a singly linked list.
Example:
Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL
Out...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#92 Reverse Linked List II（C++,Python）]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014470</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014470</guid><author>baji9701</author><pubDate>Thu, 10 Jan 2019 18:34:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#92 Reverse Linked List II（C++,Python）LeetCode
Contents
题目思路和解答思路解答C++Python


  

题目
Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of ...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#17 Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014469</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014469</guid><author>baji9701</author><pubDate>Tue, 20 Nov 2018 21:52:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#17 Letter Combinations of a Phone NumberLeetCode
Contents
题目思路和解答思路解答


  

题目
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#18 4Sum]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014467</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014467</guid><author>baji9701</author><pubDate>Thu, 15 Nov 2018 17:33:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#18 4SumLeetCode
Contents
题目思路和解答思路解答


  

题目
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = targe...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#16 3Sum Cloest]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014481</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014481</guid><author>baji9701</author><pubDate>Wed, 14 Nov 2018 20:21:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#16 3Sum CloestLeetCode
Contents
题目思路和解答思路解答


  

题目
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#15 3Sum]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014465</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014465</guid><author>baji9701</author><pubDate>Thu, 08 Nov 2018 20:16:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#15 3SumLeetCode
Contents
题目思路和解答思路解答


  

题目
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the arr...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#11 Container with Most Water]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014480</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014480</guid><author>baji9701</author><pubDate>Thu, 08 Nov 2018 16:42:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#11 Container with Most WaterLeetCode
Contents
题目思路和解答思路解答需要注意的点


  

题目
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n ...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#58 Length of Last Word]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014463</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014463</guid><author>baji9701</author><pubDate>Wed, 31 Oct 2018 10:10:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#58 Length of Last WordLeetCode
Contents
题目思路和解答思路解答


  

题目
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last w...]]></description><category></category></item><item><title><![CDATA[Python的四种常见数据结构比较]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014476</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014476</guid><author>baji9701</author><pubDate>Tue, 30 Oct 2018 14:39:00 +0800</pubDate><description><![CDATA[Python的四种常见数据结构比较Pythonlisttuplesetdict
Contents
本质上的区别语法上的比较


  

本质上的区别
最重要的区别在于是否可变，是否有序这两个维度，可以分成4个象限，如下图
比较

  

语法上的比较











list
tuple
dict
set




创建
a=[element1,element2,......]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#53 Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014473</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014473</guid><author>baji9701</author><pubDate>Tue, 30 Oct 2018 14:33:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#53 Maximum SubarrayLeetCode
Contents
题目思路和解答思路解答需要注意的点


  

题目
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#38 Count and Say]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014471</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014471</guid><author>baji9701</author><pubDate>Mon, 29 Oct 2018 19:59:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#38 Count and SayLeetCode
Contents
题目思路和解答题意思路解答总结


  

题目
The count-and-say sequence is the sequence of integers with the first five terms as following:
1.1
2.11
3.21
4.1211
5...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#6 Zigzag Conversion]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014468</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014468</guid><author>baji9701</author><pubDate>Fri, 26 Oct 2018 11:58:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#6 Zigzag ConversionLeetCode
Contents
题目思路和解答思路解答要注意的一些点参考


  

题目
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#5 Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014449</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014449</guid><author>baji9701</author><pubDate>Thu, 25 Oct 2018 17:35:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#5 Longest Palindromic SubstringLeetCode
Contents
题目思路和解答思路解答


  

题目
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#3 Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014453</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014453</guid><author>baji9701</author><pubDate>Wed, 24 Oct 2018 16:09:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#3 Longest Substring Without Repeating CharactersLeetCode
Contents
题目思路和解答思路解答高票解答


  

题目
Given a string, find the length of the longest substring without repeating characters...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#35 Search Insert Position]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014447</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014447</guid><author>baji9701</author><pubDate>Tue, 23 Oct 2018 20:24:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#35 Search Insert PositionLeetCode
Contents
题目思路和解答思路解答高票答案要注意的点


  

题目
Given a sorted array and a target value, return the index if the target is found. If not, return the in...]]></description><category></category></item><item><title><![CDATA[LeetCode Notes_#28 Implement strStr()]]></title><link>https://blog.youkuaiyun.com/baji9701/article/details/102014450</link><guid>https://blog.youkuaiyun.com/baji9701/article/details/102014450</guid><author>baji9701</author><pubDate>Tue, 23 Oct 2018 15:37:00 +0800</pubDate><description><![CDATA[LeetCode Notes_#28 Implement strStr()LeetCode
Contents
题目思路及解答思路解答需要注意的点


  

题目
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not par...]]></description><category></category></item></channel></rss>