360面试题

package test;

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
java.util.Scanner ms = new java.util.Scanner(System.in);
while (true) {
int n = ms.nextInt();
int b = ms.nextInt();
int c = 0;
if (n % 2 == 1) {
int mid = (n + 1) / 2;
if (b < mid) {
c = b + 1;
} else if (b > mid) {
c = b - 1;
} else if (b == mid) {
c = b;
}
} else {
int mid1 = n / 2;
int mid2 = n / 2 + 1;
if (b > mid2) {
c = b - 1;
} else if (b < mid1) {
c = b + 1;
} else {
c = mid1;
}
}
System.out.println(c);
}
}
}

package test;

public class Solution {

public static void main(String[] args) {
// TODO Auto-generated method stub
java.util.Scanner ms = new java.util.Scanner(System.in);
while (true) {
int n = ms.nextInt();
int m = ms.nextInt();
String str = ms.nextLine();
for (int i = 0; i < m; i++) {
int index = ms.nextInt();
char ch = ms.next().charAt(0);
char[] strc = null;
strc = str.toCharArray();
strc[index - 1] = ch;
int rsum = 0;
for (int j = 0; j < strc.length - 1; j++) {
if (strc[j] == '.' && strc[j + 1] == '.') {
rsum++;
}
}
System.out.println(rsum);
}
}
}

}

#include<stdio.h>

void main () {
int n,b;
int mid, mid1, mid2;
while (1) {
scanf("%d", &n);
scanf("%d", &b);
if (n % 2 == 1) {
mid = (n + 1) / 2;
if (b < mid) {
printf("%d\n", b + 1);
} else if (b > mid) {
printf("%d\n", b - 1);
} else if (b == mid) {
printf("%d\n", b);
}
} else {
mid1 = n / 2;
mid2 = n / 2 + 1;
if (b > mid2) {
printf("%d\n", b - 1);
} else if (b < mid1) {
printf("%d\n", b + 1);
} else {
printf("%d\n", mid1);
}
}
}
}