AP-1 | Coding Bat Answers

Maybe your like

Coding Bat Answers

The Ultimate guide to every JavaBat problem

AP-1

CODING BAT ANSWERS IS MOVING, PLEASE CLICK HERE TO VIEW SOLUTIONS TO EVERY JAVABAT PROBLEM AND LEARN FROM MY MISTAKES!!!!

This section covers the AP-1 questions from coding bat that includes: scoresIncreasing, scores100, scoresClump, scoresAverage, wordsCount, wordsFront, wordsWithoutList, hasOne, dividesSelf, copyEvens, copyEndy, matchUp, scoreUp, wordsWithout, scoresSpecial, sumHeights, sumHeights2, bigHeights, userCompare, mergeTwo, and commonTwo.

scoresIncreasing

public boolean scoresIncreasing(int[] scores) { boolean flag = true; for(int s=1; s<scores.length; s++){ if(scores[s-1]>scores[s]) flag=false; } return flag; }

scores100

public boolean scores100(int[] scores) { for(int i = 0; i < scores.length; i++) { if(i > 0) { if(scores[i] == 100 && scores[i - 1] == 100) { return true; } } } return false; }

scoresClump

public boolean scoresClump(int[] scores) { for (int i=0; i<scores.length-2; i++){ if(scores[i]+2>= scores[i+1] && scores[i]+2>= scores[i+2]){ return true;} } return false; }

scoresAverage

public int scoresAverage(int[] scores) { int avg1 = average(scores, 0, scores.length/2); int avg2 = average(scores, scores.length/2, scores.length-1); if (avg1 > avg2) return avg1; else return avg2; } int average(int[] scores, int start, int end) { int total = 0; int divisor = 0; if(start == 1 && end == 1) end = scores.length; for (int x = start; x < end; x++) { total += scores[x]; } if(scores.length <= 2) divisor = 1; else divisor = end - start; return (int)total/divisor; }

wordsCount

public int wordsCount(String[] words, int len) { int count = 0; for(String s:words) {if(s.length() == len)count++;} return count; }

wordsFront

public String[] wordsFront(String[] words, int n) { String[] rofl = new String[n]; for(int i = 0; i < n; i++) { rofl[i] = words[i]; } return rofl; }

wordsWithoutList

public List wordsWithoutList(String[] words, int len) { List l = new ArrayList(); for(String s:words) { if(s.length() != len)l.add(s); } return l; }

hasOne

public boolean hasOne(int i) { return (i+"").contains("1"); }

dividesSelf

public boolean dividesSelf(int n) { String str= Integer.toString(n); for (int i =0; i< str.length(); i++) { char a= str.charAt(i); int c = Character.getNumericValue(a); if (c ==0) return false; if (n%c !=0) return false; } return true; }

copyEvens

public int[] copyEvens(int[] nums, int count) { int[] nums2 = new int[count]; for(int i = 0; i < nums.length; i++) { if(nums[i] % 2 == 0) { for(int k = 0; k < nums2.length; k++) { if(nums2[k] == 0) { nums2[k] = nums[i]; break; } } } } return nums2; }

copyEndy

public int[] copyEndy(int[] nums, int count) { int[] array=new int[count]; ArrayList<Integer> list=new ArrayList<Integer>(); for(int i=0;i<nums.length;i++) if(isEndy(nums[i])) list.add(nums[i]); for(int i=0;i<count;i++) array[i]=list.get(i); return array; } public boolean isEndy(int num) { return(num>= 0 && num<=10) || (num>=90 && num<=100); }

matchUp

public int matchUp(String[] a, String[] b) { int count = 0; for(int i = 0; i < a.length; i++){ if( (!a[i].isEmpty()) && (!b[i].isEmpty()) && (a[i].charAt(0) == b[i].charAt(0)) ){ count++; } } return count; }

scoreUp

public int scoreUp(String[] key, String[] answers) { int score = 0; for(int i = 0; i < key.length; i++) { if(answers[i].equals("?")) { } else if(answers[i].equals(key[i])) { score += 4; } else { score -= 1; } } return score; }

wordsWithout

public String[] wordsWithout(String[] words, String target) { int count = 0, k = 0; for(int i = 0; i < words.length; i++) { if(words[i].equals(target)) { } else { count++; } } String[] result = new String[count]; for(int i = 0; i < words.length; i++) { if(words[i].equals(target)) { } else { result[k] = words[i]; k++; } } return result; }

scoresSpecial

public int scoresSpecial(int[] a, int[] b) { return maxSpecialScore(a) + maxSpecialScore(b); } public int maxSpecialScore(int[] nums){ int maxSpec = 0; for(int i = 0; i < nums.length; i++){ if(nums[i] % 10 == 0 && nums[i] > maxSpec) maxSpec = nums[i]; } return maxSpec; }

sumHeights

public int sumHeights(int[] heights, int start, int end) { int total =0; for(int i=start;i<end;i++){ int difference =0; if(heights[i] > heights[i+1]){ difference =heights[i] - heights[i+1]; }else if(heights[i+1] > heights[i]){ difference =heights[i+1] - heights[i]; } total+=difference; } return total; }

sumHeights2

public int sumHeights2(int[] heights, int start, int end) { int result = 0; for(int i = start; i < end; i++) if(heights[i + 1] > heights[i]) result += (Math.abs(heights[i] - heights[i + 1]) * 2); else result += Math.abs(heights[i] - heights[i + 1]); return result; }

bigHeights

public int bigHeights(int[] heights, int start, int end){ int bigsteps = 0; for (int i = start + 1; i <= end; i++) { if (Math.abs(heights[i] - heights[i - 1]) >= 5) bigsteps++; } return bigsteps; }

userCompare

public int userCompare(String aName, int aId, String bName, int bId) { if ((aName.compareTo(bName) <0) || ((aName.compareTo(bName) ==0) && aId < bId)) return -1; else if ((aName.compareTo(bName) >0)|| ((aName.compareTo(bName) ==0) && aId < bId)) return 1; else if ((aName.compareTo(bName) ==0)&& aId == bId) return 0; else return 1; }

mergeTwo

public String[] mergeTwo(String[] a, String[] b, int n) { ArrayList<String> list=new ArrayList<String>(); String[] array=new String[n]; for(int i=0;i<a.length;i++) list.add(a[i]); for(int i=0;i<b.length;i++) list.add(b[i]); for (int i=0; i<list.size(); i++) { for (int j=0; j<list.size(); j++) { if (list.get(j).compareTo(list.get(i))>0) { String temp = list.get(i); list.set(i,list.get(j)); list.set(j,temp); } } } for(int i=0;i<list.size()-1;i++) if(list.get(i+1).equals(list.get(i))) list.remove(i); for(int i=0;i<array.length;i++) array[i]=list.get(i); return array; }

commonTwo

public int commonTwo(String[] a, String[] b) { int count=0; int big; int temp=0; int alen=a.length; int blen=b.length; big=alen+blen; String[] common= new String[big+1]; String last=""; for (int i=0; i<alen; i++) { if (a[i]!=last) { common[i]=a[i]; last =a[i]; } } int c=0; last =""; for (int x=alen; x<big; x++) { if (b[c] !=last) { common[x]=b[c]; last =b[c]; } c++; } for (int r=0; r < big; r++){ temp=0; for (int z=0; z<big; z++) { if (common[r] !=null && common[z]!=null) if (common[r].equals(common[z])) temp++; } if (temp>1) count++; } return count/2; }