博客园-蔚蓝天空-最新评论http://www.cnblogs.com/lanshh/CommentsRSS.aspxzh-cnSun, 22 Jan 2012 14:44:11 GMTSun, 22 Jan 2012 14:44:11 GMTcnblogsRe:2011年最后一小时http://www.cnblogs.com/lanshh/archive/2012/01/22/2328865.html#2297445晓岚晓岚Sun, 22 Jan 2012 14:45:48 GMThttp://www.cnblogs.com/lanshh/archive/2012/01/22/2328865.html#2297445
晓岚 2012-01-22 22:45 发表评论
]]>re: Server.MapPath() 探究http://www.cnblogs.com/lanshh/archive/2009/06/24/438826.html#1567503郎涛郎涛Wed, 24 Jun 2009 12:08:07 GMThttp://www.cnblogs.com/lanshh/archive/2009/06/24/438826.html#1567503
郎涛 2009-06-24 20:08 发表评论
]]>re: 2008年的最后一分钟http://www.cnblogs.com/lanshh/archive/2009/01/01/1366392.html#1418775丁学丁学Wed, 31 Dec 2008 16:26:22 GMThttp://www.cnblogs.com/lanshh/archive/2009/01/01/1366392.html#1418775
丁学 2009-01-01 00:26 发表评论
]]>re: ASP.NET + MySQL问题解决步骤http://www.cnblogs.com/lanshh/archive/2008/11/09/593501.html#1365121niuniuSun, 09 Nov 2008 02:33:48 GMThttp://www.cnblogs.com/lanshh/archive/2008/11/09/593501.html#1365121
niu 2008-11-09 10:33 发表评论
]]>re: 子数组的最大和 最大子数组http://www.cnblogs.com/lanshh/archive/2008/07/29/1210515.html#1270896新手11223sdfsd新手11223sdfsdTue, 29 Jul 2008 05:20:04 GMThttp://www.cnblogs.com/lanshh/archive/2008/07/29/1210515.html#1270896...{
public static void main(String[] args)
...{
ArrayList<int[]> testData = new ArrayList<int[]>();
//这是一些测试用的数组
testData.add(new int[]...{-7,15,2,-5,12,6,-26});
testData.add(new int[]...{1});
testData.add(new int[]...{12, -8, 5, 66, -21, 0,35, -44,7});
testData.add(new int[]...{-100,-100,-100,-100,100});
testData.add(new int[]...{3,73,-95,42,43,29,-30,-87,74,-53,22,74,-91,-1,-27,-8,-14,26,-67,-74});
testData.add(new int[]...{12, -8, 71, -21, 35, -44,7 ,-2000,1999});
testData.add(new int[]...{98,99,-2,-99,100,-99,-2});
testData.add(new int[]...{-2, 11, -4, 13, -5, -2});
testData.add(new int[]...{-1});

for(int[] array:testData)
...{
System.out.println(Arrays.toString(array));
System.out.println("result:"+findMaxSubArray(array));
System.out.println();
}
}

static private SubArray findMaxSubArray(int[] intArray)
...{
//去头，去尾
int bIndex = 0,eIndex = intArray.length-1;
while(intArray[bIndex]<=0 && bIndex+1<intArray.length)...{bIndex++;}
while(intArray[eIndex]<=0 && eIndex-1>=0)...{eIndex--;}

LinkedList<SubArray> saList = new LinkedList<SubArray>();
for(int i=bIndex; i<=eIndex; i++)
...{
saList.add(new SubArray(i,intArray[i]));
}

//合并相邻的属性相似的数据
Iterator<SubArray> iter = saList.iterator();
if(iter.hasNext())
...{
SubArray a = iter.next();
while(iter.hasNext())
...{
SubArray b = iter.next();
if((a.getSum()>=0 && b.getSum()>=0)||(a.getSum()<=0 && b.getSum()<=0))
...{
a.m(b);
iter.remove();
}
else
...{
a = b;
}
}
}

//跨区段合并更大范围的数据
SubArray[] array = new SubArray[saList.size()];
array = saList.toArray(array);
if(array.length>=3)
...{
for(int i=1;i<array.length; i+=2)
...{
SubArray a = array[i-1];
SubArray b = array[i];
SubArray c = array[i+1];
int sum = a.getSum()+b.getSum()+c.getSum();
if( sum > a.getSum() && sum > c.getSum())
...{
a.m(b);
a.m(c);
array[i-1] = null;
array[i] = null;
array[i+1] = a;
}
}
}
//找到sum值最大的一段
SubArray maxSubArray = null;
for(int i=0;i<array.length; i++)
...{
if(null!=array[i])
...{
if(null==maxSubArray || array[i].getSum()>maxSubArray.getSum())
...{
maxSubArray = array[i];
}
}
}
return maxSubArray;
}

/** *//**
* 为了记录原始下标而建立的 子数组 对象
* @author 顾法华，杭州
*
*/
static private class SubArray
...{
int head = -1;
LinkedList<Integer> content;

SubArray(int head,LinkedList<Integer> subArray)
...{
this.head = head;
this.content = subArray;
}

SubArray(int head,int v)
...{
this(head,new LinkedList<Integer>());
content.add(v);
}

public void m(SubArray sa)
...{
content.addAll(sa.content);
}

public int getSum()
...{
int s = 0;
for(int i : content)
...{
s += i;
}
return s;
}

public String toString()
...{
return this.getSum()+" ("+head+"~"+(head+content.size()-1)+") "+content.toString();
}
}
}
//找到这个你看看

]]>re: 子数组的最大和 最大子数组http://www.cnblogs.com/lanshh/archive/2008/07/29/1210515.html#1270882新手11223sdfsd新手11223sdfsdTue, 29 Jul 2008 05:16:01 GMThttp://www.cnblogs.com/lanshh/archive/2008/07/29/1210515.html#1270882
我运行了一下
the max sum for sub array:
18
new sum array m:
1 -1 3 13 9 16 18 13
max sub array:-2 10 -4 7 2 -5

没看懂

]]>re: Server.MapPath() 探究http://www.cnblogs.com/lanshh/archive/2008/05/21/438826.html#1205348nengrenjunengrenjuWed, 21 May 2008 14:36:38 GMThttp://www.cnblogs.com/lanshh/archive/2008/05/21/438826.html#1205348
nengrenju 2008-05-21 22:36 发表评论
]]>re: Server.MapPath() 探究http://www.cnblogs.com/lanshh/archive/2008/05/16/438826.html#1200847铁山铁山Fri, 16 May 2008 08:30:00 GMThttp://www.cnblogs.com/lanshh/archive/2008/05/16/438826.html#1200847
铁山 2008-05-16 16:30 发表评论
]]>re: 孤立用户（翻译）http://www.cnblogs.com/lanshh/archive/2008/01/08/724400.html#1030006AnselZhengAnselZhengTue, 08 Jan 2008 02:55:00 GMThttp://www.cnblogs.com/lanshh/archive/2008/01/08/724400.html#1030006
AnselZheng 2008-01-08 10:55 发表评论
]]>re: ASP.NET错误处理的方式（总结）http://www.cnblogs.com/lanshh/archive/2007/12/06/438444.html#985374书生多命贱书生多命贱Thu, 06 Dec 2007 07:23:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/12/06/438444.html#985374EventLog 需要引入 System.Diagnostics名称空间！


书生多命贱 2007-12-06 15:23 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/11/01/436163.html#946063asdasdasdasdThu, 01 Nov 2007 10:58:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/11/01/436163.html#946063
asdasd 2007-11-01 18:58 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/10/17/436163.html#927865sywsywWed, 17 Oct 2007 09:12:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/10/17/436163.html#927865
syw 2007-10-17 17:12 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898692李赛钰李赛钰Wed, 19 Sep 2007 08:33:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898692when you start to crack
when it's all to hell
know i have your back
whether right or wrong
is beside the point
'cause we're more than blood

李赛钰 2007-09-19 16:33 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898410飒飒飒飒Wed, 19 Sep 2007 05:44:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898410
飒飒 2007-09-19 13:44 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898405郭韬郭韬Wed, 19 Sep 2007 05:40:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/09/19/436163.html#898405
郭韬 2007-09-19 13:40 发表评论
]]>re: Server.MapPath() 探究http://www.cnblogs.com/lanshh/archive/2007/09/17/438826.html#896136邓林海邓林海Mon, 17 Sep 2007 09:15:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/09/17/438826.html#896136
邓林海 2007-09-17 17:15 发表评论
]]>re: Server.MapPath() 探究http://www.cnblogs.com/lanshh/archive/2007/07/11/438826.html#814272gmgmWed, 11 Jul 2007 08:27:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/07/11/438826.html#814272
gm 2007-07-11 16:27 发表评论
]]>re: ASP.NET页面生存周期（理论）http://www.cnblogs.com/lanshh/archive/2007/06/08/590941.html#776796马可香蕉马可香蕉Fri, 08 Jun 2007 09:00:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/06/08/590941.html#776796
马可香蕉 2007-06-08 17:00 发表评论
]]>re: .NET中英文转换的实现http://www.cnblogs.com/lanshh/archive/2007/05/21/436163.html#7536411212Sun, 20 May 2007 17:16:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/05/21/436163.html#753641

12 2007-05-21 01:16 发表评论
]]>re: ASP.NET错误处理的方式（总结）http://www.cnblogs.com/lanshh/archive/2007/05/17/438444.html#750462ddr888ddr888Thu, 17 May 2007 09:57:00 GMThttp://www.cnblogs.com/lanshh/archive/2007/05/17/438444.html#750462 8 if (!EventLog.SourceExists(LogName))
9 {
10 EventLog.CreateEventSource(LogName, LogName);
11 }

为什么我在global里面写的 相似的功能不能创建相应的时间日志来源 ，
但是我又重新写个winform的同样的代码就可以用？

ddr888 2007-05-17 17:57 发表评论
]]>