拼多多笔试,麻烦大佬看看哪错了

第一题  90分
import java.util.Scanner;  public class Main { public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);  int hp = sc.nextInt();  int nor = sc.nextInt();  int att = sc.nextInt();  if (nor*2>att){ if(hp%nor>0) {
                System.out.println(hp / nor + 1);  }else{
                System.out.println(hp / nor);  }
        }else{ int temp = hp%att;  int num = hp/att;  if(temp>=nor*2){
                System.out.println(num*2+2);  }else{
                System.out.println(num*2+1);  }
        }

    }
}
第三题  80分
import java.util.Scanner;  public class 棋盘 { public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);  String bb = sc.nextLine();  String[] cc = bb.split(" ");  int n = Integer.parseInt(cc[0]);  int m = Integer.parseInt(cc[1]);  char[][] arr = new char[n][m];  for(int i = 0;i<n;i++){
            String aa = sc.nextLine();  for(int j =0;j<m;j++){
               arr[i][j]=aa.charAt(j);  }
        } for (int p=0;p<n;p++) { for (int i = n - 1; i >= 0; i--) { for (int j = 0; j < m; j++) { if (i == n - 1) { if (arr[i][j] == 'o') {
                            arr[i][j] = '.';  }
                    } else { if (arr[i][j] == 'o') { if (arr[i + 1][j] == '.') {
                                arr[i][j] = '.';  arr[i + 1][j] = 'o';  }
                        }
                    }
                }
            }
        } for(int i = 0;i<n;i++){ for(int j =0;j<m;j++){
                System.out.print(arr[i][j]);  }
            System.out.println();  }
    }
}
第四题  70分
import java.util.Arrays; import java.util.Scanner;  public class 单词 { public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);  String bb = sc.nextLine();  String[] cc = bb.split(" ");  int n = Integer.parseInt(cc[0]);  int m = Integer.parseInt(cc[1]);  char[][] arr = new char[n][m];  char[][] arr2 = new char[m][n];  String[] dd = new String[n];  String[] ee = new String[n*m];  for(int i = 0;i<n;i++){
            String aa = sc.nextLine();  dd[i] = aa;  for(int j =0;j<m;j++){
                arr[i][j]=aa.charAt(j);  }
        } for(int i = 0;i<m;i++){ for(int j =0;j<n;j++){
                arr2[i][j] = arr[j][i];  }
        } for(int i = 0;i<m;i++){
            Arrays.sort(arr2[i]);  } int point = 0;  int count = m-1;  while (true){
            String arrr = "";  if(point==n){ if(count==0){ break;  }
                point =0;  count++;  } for(int i = 0;i<m;i++){ if(i==count){
                    arrr =  arrr+arr2[i][point];  point++;  }else{
                    arrr =  arrr+arr2[i][0];  }
            } for(int i = 0;i<n;i++){ if(!dd[i].equals(arrr)){
                    System.out.println(arrr);  return;  }
            }
        }
        System.out.println("-");   }
}

#拼多多#
全部评论
第一题,temp 怎么跟nor*2比较,不应该是跟temp比较么,小于等于的话再来一次攻击,大于的话来一次蓄力攻击。
点赞 回复
分享
发布于 2018-08-30 21:20
include <iostream> using namespace std; int main(){ int HP; cin >> HP; int normal; cin >> normal; int buffer; cin >> buffer; if (HP <= normal) { cout << 1; return 0; } else if (HP <= buffer) { cout << 2; return 0; } if (2 * normal >= buffer) { cout << HP%normal ? HP / normal + 1 : HP / normal; } else { if (!(HP%buffer)) { cout << HP / buffer * 2; } else { if (HP%buffer <= normal) { cout << HP / buffer * 2 + 1; } else { cout << HP / buffer * 2 + 2; } } } system("pause"); return 0; }
点赞 回复
分享
发布于 2018-08-30 21:40
联易融
校招火热招聘中
官网直投

相关推荐

点赞 收藏 评论
分享
牛客网
牛客企业服务