Mycode:publicclassSolution{privateintcounter=0;publicinttotalNQueens(intn){if(n=n){counter++;return;}

Mycode:/***Definitionforapoint.

Mycode:publicclassNumArray{privateint[]nums;privateint[]st;publicNumArray(int[]nums){if(nums==null||nums.length

Mycode:importjava.util.ArrayList;importjava.util.List;publicclassSolution{publicListrestoreIpAddresses

Mycode:publicclassSolution{publicbooleancontainsNearbyAlmostDuplicate(int[]nums,intk,intt){if(kmap=newHashMap

本身已经自带了svn，所以我们只需要简单的配置一下就可以进行使用了一下是配置的步骤*在User/roy/下创建一个SVN文件夹*打开终端，执行命令svnadmincreate/Users/roy/svn/mycode

Mycode:publicclassSolution{publicStringgetPermutation(intn,intk){if(n0){total*=temp;temp--;}if(k>total

Mycode:publicclassSolution{publicStringremoveDuplicateLetters(Strings){if(s==null||s.length()==0)returns

Mycode:importjava.util.ArrayList;importjava.util.Arrays;importjava.util.List;publicclassSolution{publicList

创建代码库在/User/apple目录下新建SVN目录$svnadmincreate/Users/apple/svn/mycode（生成svn本地仓库）配置用户权限修改默认文件内容1、/svn/mycode

Mycode:publicclassSolution{publicStringshortestPalindrome(Strings){if(s==null||s.length()==0){returns

源码安装1.下载安装包wgethttps://GuoFlight.Github.io/Mycode/Linux/software_install/privoxy-3.0.28-stable-src.tar.gz2

Mycode:/***D

Mycode:publicclassSolution{publicStringrearrangeString(Stringstr,intk){if(str==null){return"";}elseif

Mycode:importjava.util.ArrayList;importjava.util.List;publicclassSolution{publicList>solveNQueens(intn

后来把spark版本换成了2.1.0的版本后在安装sbt就安装成功了，然后试了一下教程下面的例子，成功了，心态差点爆炸catword.txt查看文本内容加载本地文件cd/usr/local/spark/mycode

Mycode:/***Definitionforsingly-linkedlist.

py#-*-coding:UTF-8-*-print'测试2运行'foriinrange(6,10):printiprint'测试2结束'run.sh是我写的批处理脚本：该脚本路径：/home/ZPJ/mycode

Mycode:publicclassSolution{publicintfirstMissingPositive(int[]nums){if(nums==null||nums.length==0){return1

Mycode:importjava.util.ArrayList;importjava.util.List;/***Definitionforabinarytreenode.

Mycode:publicclassSolution{publicint[]getModifiedArray(intlength,int[][]updates){if(length<=0){returnnull

returnitscorrespondingcolumntitleasappearinanExcelsheet.Forexample:1->A2->B3->C...26->Z27->AA28->AB**Mycode

Mycode:publicclassSolution{publicListgenerateAbbreviations(Stringword){Listret=newArrayList();if(word

Mycode:/***Definitionforabinarytreenode.

Mycode:publicclassSolution{publicListgeneratePalindromes(Strings){Listret=newArrayList();if(s==null||

**Mycode:publicclassSolution{publicdoublefindMed

Mycode:importjava.util.HashMap;importjava.util.HashSet;publicclassSolution{publicbooleanwordPattern(Stringpattern

问题：按照网上的教程搭建本地svn，一步步过来都成功了，但是上传项目时报错：Description:Can'topenfile'/Users/用户名xx/svn/mycode/db/txn-current-lock

Mycode:publicclassSolution{publicintsingleNumber(int[]nums){if(nums==null||nums.length==0)return0;int

Mycode:/***Definitionforabinarytreenode.

Mycode:importjava.util.ArrayList;importjava.util.Collections;importjava.util.Comparator;importjava.util.List

难度低于RemoveInvalidParentheseshttp://www.jianshu.com/p/107a8e166351Mycode:importjava.util.ArrayList;importjava.util.HashSet

Mycode:publicclassSolution{publiccharfindTheDifference(Strings,Stringt){char[]c1=s.toCharArray();char

Mycode:publicclassSolution{publicintminCost(int[][]costs){if(costs==null||costs.length==0||costs[0].length

Mycode:publicclassSolution{privateintmin=-1;publicintcoinChange(int[]coins,intamount){if(coins==null|

Mergetwosortedlinkedlistsandreturnitasanewlist.Thenewlistshouldbemadebysplicingtogetherthenodesofthefirsttwolists.Mycode

Mycode:publicclassSolution{privateclasswordNode{Strings;intstep;wordNodepre;wordNode(Strings,intstep,

Mycode:publicclassSolution{publicintbulbSwitch(intn){return(int)Math.sqrt(n);}}reference:https://discuss.leetcode.com

Mycode:publicclassSolution{publicListgeneratePossibleNextMoves(Strings){Listret=newArrayList();if(s==

Mycode:importjava.util.ArrayList;importjava.util.Arrays;importjava.util.HashMap;importjava.util.List;

Mycode:publicclassSolution{privateintcounter=0;publicintstrobogrammaticInRange(Stringlow,Stringhigh){

Mycode:publicclassSolution{publicintnumSquares(intn){if(n=0){dp[i]=(dp[i]==0?

Mycode:publicclassSolution{publicbooleancanPermutePalindrome(Strings){if(s==null||s.length()==0){returntrue

Mycode:importjava.util.Arrays;publicclassSolution{publicbooleanisAnagram(Strings,Stringt){if(s==null|

Description:Writeafunctiontofindthelongestcommonprefixstringamongstanarrayofstrings.Mycode:/***@param

Mycode:/***@param{number}rowIndex*@return{n

Mycode:/***Definitionforsingly-linkedlist.*functionListNode(val){*this.val=val;*this.next=null;*}*/

Mycode:/***@pa

generatethefirstnumRowsofPascal'striangle.Forexample,givennumRows=5,Return[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]Mycode

finditsmaximumdepth.Themaximumdepthisthenumberofnodesalongthelongestpathfromtherootnodedowntothefarthestleafnode.Mycode