摘要:
Summary: This poj problem is another typical example for dynamic planning.Well, the idea is very delicate. I tried to calculate the longgest sbsequenc 阅读全文
摘要:
Recently I've been working on problems in POJ, which is really tough with JAVA. Okay,things to be paid attention to include: First, your class name sh 阅读全文
摘要:
数组拷贝(System.arraycopy,深度拷贝)--数组【ITjob课程资料】拷贝数组数组一旦创建后,其大小不可调整。然而,你可使用相同的引用变量来引用一个全新的数组:int[] myArray = new int [6];myArray = new int[10];在这种情况下,第一个数组被... 阅读全文