蓝桥杯-寻找数列中最大数

2019-11-14 12:42:51

字体：大中小

来源：转载

供稿：网友

http://lx.lanqiao.cn/PRoblem.page?gpid=T111

按照题意，是应该用数组来做的，后面用集合的方式就不能通过官方测试系统。（有点醉~~~）

//通过import java.util.Scanner;public class Main { public static void main(String[] args){ int[] a = new int[1001]; Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int max = 0; int t = 0; for (int i=0;i<n;i++){ a[i] = sc.nextInt(); if (i==0){ max = a[i]; t = i; }else if (i>0){ if (max <a[i]){ max = a[i]; t = i; } } } System.out.println(max +" " +t); }}//不能通过import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class Main { public static void main(String[] args){ Map<Integer, Integer> map = new HashMap<Integer, Integer>(); Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int max = 0; int t = 0; int key; for (key=0;key<n;key++){ int value = sc.nextInt(); map.put(key, value); if (key==0){ max = map.get(key); t=key; }else if(key>0){ if (max < map.get(key)){ max = map.get(key); t = key; } System.out.println("t="+t + "max="+max); } } System.out.println(max + " " +t); }}

上一篇：Leetcode 410 - Split Array Largest Sum（dp or 二分答案）

下一篇：Java基础--面向对象2