这是《编程之美》上面的一道题,大体看过一点,早就忘了,昨天考试又遇到了,就想了下。下面的代码中第一个方法时间复杂度为O(n*n),第二个方法为O(n)。
- public class FloorNum
- {
- public static void main(String[] args)
- {
- int[] arr = {3, 2, 7, 5, 9, 4, 6};
- calculate(arr);
- calculator2(arr);
- }
- private static void calculate(int[] arr)
- {
- int sum = 0;
- int min = Integer.MAX_VALUE;
- int k = 0;
- int floor = 0;
- for(int i=0; i<arr.length; i++)
- {
- sum = 0;
- for(int j=0; j<arr.length; j++)
- {
- k = Math.abs(j-i);
- sum += k * arr[j];
- }
- if(sum < min)
- {
- min = sum;
- floor = i;
- }
- }
- System.out.println(floor + " " + min);
- }
- private static void calculator2(int[] arr)
- {
- int sum = 0;
- int temp = 0;
- int floor = 0;
- for(int i=0; i<arr.length; i++)
- {
- sum += arr[i];
- }
- for(int i=0; i<arr.length; i++)
- {
- temp += arr[i];
- if(temp*2 > sum)
- {
- floor = i;
- break;
- }
- }
- System.out.println(floor);
- }
- }
public class FloorNum
{
public static void main(String[] args)
{
int[] arr = {3, 2, 7, 5, 9, 4, 6};
calculate(arr);
calculator2(arr);
}
private static void calculate(int[] arr)
{
int sum = 0;
int min = Integer.MAX_VALUE;
int k = 0;
int floor = 0;
for(int i=0; i<arr.length; i++)
{
sum = 0;
for(int j=0; j<arr.length; j++)
{
k = Math.abs(j-i);
sum += k * arr[j];
}
if(sum < min)
{
min = sum;
floor = i;
}
}
System.out.println(floor + " " + min);
}
private static void calculator2(int[] arr)
{
int sum = 0;
int temp = 0;
int floor = 0;
for(int i=0; i<arr.length; i++)
{
sum += arr[i];
}
for(int i=0; i<arr.length; i++)
{
temp += arr[i];
if(temp*2 > sum)
{
floor = i;
break;
}
}
System.out.println(floor);
}
}
输出为:
- 4 53
- 4