250P

포스트: 2|아이템:250P(2)
Tags

Posts

2 posts

Bonuses

Code public class Bonuses{ public int[] getDivision(int[] points) { int len = points.length; int sum = 0, extra = 100; boolean[] used = new boolean[len]; int[] percents = new int[len]; for (int i = 0; i < len; i++) sum += points[i]; for (int i = 0; i

ArithmeticSequenceDiv1

불타는 아잍(IT)스크림|2019년 12월 20일

Code public class ArithmeticSequenceDiv1 { public int findMinCost(int[] x) { int n = x.length; int min = 10000; int maxGap = 0; for (int i = 0; i < n-1; i++) if(Math.abs(x[i+1]-x[i]) > maxGap) maxGap = Math.abs(x[i+1]-x[i]); for (int d = -maxGap; d