摘要:
int maxCommonDivisor(int m, int n) { if (m % n == 0) { return n; } else { return maxCommonDivisor(n, m % n); } } int minCommonMultiple(int m, int n) { return m * n /(maxCommonDivisor(m, n)); } 阅读全文
摘要:
boolean matchBracket( String str ) { Stack stack = new Stack(); try { for ( int i = 0; i < str.length(); i++ ) { char curChar = str.charAt( i ); switch ( curChar ) { case '[': ... 阅读全文
摘要:
void bubbleSort( int[] values ) { int temp; for ( int i = 0; i values[j + 1] ) { temp = values[j]; values[j] = values[j + 1]; values[j + 1] = temp; } } } } // 改进后的程序如下... 阅读全文