搜狐编程第二题
package test;
import java.util.Scanner;
public class Test3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int len =sc.nextInt();
int [] arr = new int [len];
int cout = 0;
int sum=0;
while (sc.hasNext()){
for (int i = 0; i < len; i++) {
arr[i] = sc.nextInt();
}
for (int i = 0; i < arr.length/2; i++) {
if (arr[i]!=arr[len-1-i]) {
cout=cout+2;
}
}
int [] arr1 = new int[cout+len];
for (int i = 0; i < arr.length; i++) {
if (arr[i]!=arr[len-1-i]){
if (i<(cout+len)/2) {
arr1[i+1]=arr[len-1-i];
}
}
else if (i<(cout+len)/2) {
arr1[i]=arr[i];
}
}
for (int i = 0; i < arr1.length; i++) {
arr1[(cout+len)-i] = arr1[i];
}
for (int i = 0; i < arr1.length; i++) {
sum=sum+arr1[i];
}
System.out.println(sum);
}
sc.close();
}
}
import java.util.Scanner;
public class Test3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int len =sc.nextInt();
int [] arr = new int [len];
int cout = 0;
int sum=0;
while (sc.hasNext()){
for (int i = 0; i < len; i++) {
arr[i] = sc.nextInt();
}
for (int i = 0; i < arr.length/2; i++) {
if (arr[i]!=arr[len-1-i]) {
cout=cout+2;
}
}
int [] arr1 = new int[cout+len];
for (int i = 0; i < arr.length; i++) {
if (arr[i]!=arr[len-1-i]){
if (i<(cout+len)/2) {
arr1[i+1]=arr[len-1-i];
}
}
else if (i<(cout+len)/2) {
arr1[i]=arr[i];
}
}
for (int i = 0; i < arr1.length; i++) {
arr1[(cout+len)-i] = arr1[i];
}
for (int i = 0; i < arr1.length; i++) {
sum=sum+arr1[i];
}
System.out.println(sum);
}
sc.close();
}
}
查看23道真题和解析
元戎启行二面25人在聊