u011042985的专栏

dubbo找不到类，序列化成map的源码阅读

1.spring源码分析环境的搭建和demo1.1下载源码环境搭建：sts/eclipse + jdk1.7 + windows + gradle将 https://github.com/spring-projects/spring-framework/tree/3.2.x下载下来1.2运行import-into-eclipse.bat可能会遇到的问题1.2.1 ...

遇到这个错误，我自己百度的时候没有。找了一会，发现  不应该放在实体bean.xml中，而是放在总配置文件中SqlMapConfig.xml

学习java data jpa的最简单demo

public static List collect = new ArrayList(); public static void permutation(int[] a, int begin0, int begin, int mid1, int mid2, int end, int selectNum) { int[] temp = new int[selectNum]; Syste

There are two sorted arrays nums1 and nums2 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)).Example 1:nums1 = [1,

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())", "...

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividing dividend by divisor.The integer division should ...

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input:[  1->4->5,  1->3->4,  2->6]Output: 1->1->2->3->4->4...

题目：Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.You have the following 3 operations permitted on a word:Insert a character Delete a ...

java jxl 追加和修改原有excel