摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class FoxAndGame{ public int countStars(String[] result) { int i,count; count=0; for(i=0;i res = new HashMap(); res.put("---",0); res.put("o--",1); res.put("o... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class EasyHomework{ public String determineSign(int[] A) { int i,count; count=0; for(i=0;i0) return "NEGATIVE"; else return "POSITIVE"; } ... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class SkiResortsEasy{ public int minCost(int[] altitude) { int i,count; count=0; for(i=1;ialtitude[i-1]){ count+=altitude[i]-altitude[i-1]; ... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class CityMap{ public String getLegend(String[] cityMap, int[] POIs) { int i,j; int[] count = new int[256]; char ch; StringBuilder sb = new StringBuilder(); ... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class TheSwapsDivTwo{ public int find(int[] sequence) { int i,j,count; boolean tag=false; count=0; for(i=0;i<sequence.length;i++){ for(j=i+1;j<sequence.... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class EllysNewNickname{ public int getLength(String nickname) { int i,count; count=1; for(i=1;i<nickname.length();i++){ if(!isVowel(nickname.charAt(i))) count++; else if(isVowel(nickname.charAt... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class TheExperimentDiv2{ public int[] determineHumidity(int[] intensity, int L, int[] leftEnd) { int[] r = new int[leftEnd.length]; int i,j; for(i=0;i}//Powered by Kawigi... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class DeerInZooDivTwo{ public int[] getminmax(int N, int K) { int min,max; int[] r = new int[2]; if(N-K>0) min =N-K; else min=0; max = N - (int)Math.ceil(K/2.0); r[0] = min; r[1] = max; ... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class PrimalUnlicensedCreatures{ public int maxWins(int initialLevel, int[] grezPower) { int i,count,pre,level; boolean[] tag = new boolean[grezPower.length]; pre=-1; count=0; level = initialLevel; i... 阅读全文

摘要：菜鸟的代码：import java.util.*;import java.util.regex.*;import java.text.*;import java.math.*;public class ShoutterDiv2{ public int count(int[] s, int[] t) { int i,j,count; count=0; for(i=0;i=s[j]) count++; } } return c... 阅读全文

摘要：没有想到好的算法，用回溯法给爆破了。。。public class ColorTheCells{ private int min_time; public int minimalTime(int[] dryingTime){ int len = dryingTime.length; int[] dryThen = new int[len]; int i; for(i=0;i<len;i++) dryThen[i] = 0; min_time = ... 阅读全文