zoukankan      html  css  js  c++  java
  • 从零自学Java-7.使用数组存储信息

    1.创建数组;

    2.设置数组的大小;

    3.为数组元素赋值;

    4.修改数组中的信息;

    5.创建多维数组;

    6.数组排序。

    程序SpaceRemover:显示输入字符串,并将其中所有的空格字符替换为句点字符。

     1 package com.jsample;
     2 
     3 public class SpaceRemover {
     4     public static void main(String[] args){
     5         String mostFamous = "Rudolph the Red-nosed Reindeer";
     6         char[] mfl = mostFamous.toCharArray();//将文本中的每一个字符存储到数组的一个元素中
     7         for (int dex = 0; dex < mfl.length; dex++){
     8             char current = mfl[dex];
     9             if (current != ' '){
    10                 System.out.print(current);
    11             }
    12             else
    13                 System.out.print('.');
    14         }
    15         System.out.println();
    16     }
    17 }
    View Code

    输出:

    Rudolph.the.Red-nosed.Reindeer

    程序NameSorter:将字符串数组中的姓名按字母序排序

     1 package com.jsample;
     2 
     3 import java.util.*;
     4 
     5 public class NameSorter {
     6     public static void main(String[] args){
     7         String names[] ={"Glimmer", "Marvel", "Rue", "Clove",
     8                 "Thresh", "Foxface", "Cato", "Peeta", "Katniss"};
     9         System.out.println("The origin order:");
    10         for(int i = 0; i < names.length; i++){
    11             System.out.println(i + ": " + names[i]);
    12         }
    13         System.out.println();
    14         Arrays.sort(names);
    15         System.out.println("The new order:");
    16         for(int i = 0; i < names.length; i++){
    17             System.out.println(i + ": " + names[i]);
    18         }
    19         System.out.println();
    20     }
    21 }
    View Code

    输出:

    The origin order:
    0: Glimmer
    1: Marvel
    2: Rue
    3: Clove
    4: Thresh
    5: Foxface
    6: Cato
    7: Peeta
    8: Katniss

    The new order:
    0: Cato
    1: Clove
    2: Foxface
    3: Glimmer
    4: Katniss
    5: Marvel
    6: Peeta
    7: Rue
    8: Thresh

    程序Wheel:用来统计字母在不同短语或表达中出现的频率,并使用数组来存放每个字母出现的字数。当程序运行时,它将显示每个字母在短语中出现的次数。

     1 package com.jsample;
     2 
     3 public class Wheel {
     4     public static void main(String[] args){
     5         String[] phrase={
     6                 "A STITCH IN TIME SAVES NINE",
     7                 "DON'T EAT YELLOW SNOW",
     8                 "JUST DO IT",
     9                 "EVERY GOOD BOY DOES FINE",
    10                 "I WANT MY MTV",
    11                 "I LIKE IKE",
    12                 "PLAY IT AGAIN,SAM",
    13                 "FROSTY THE SNOWMAN",
    14                 "ONE MORE FOR THE ROAD",
    15                 "HOME FIELD ADVANTAGE",
    16                 "VALENTINE'S DAY MASSACRE",
    17                 "GROVER CLEVELAND OHIO",
    18                 "SPAGHETTI WESTERN",
    19                 "AQUA TEEN HUNGER FORCE",
    20                 "IT'S A WONDERFUL LIFE"
    21         };
    22         int[] letterCount = new int[26];
    23         for(int count = 0; count < phrase.length; count++){
    24             String current = phrase[count];
    25             char[] letters = current.toCharArray();
    26             for (int count2 = 0; count2 < letters.length; count2++){
    27                 char left = letters[count2];
    28                 if ((left >= 'A') & (left <= 'Z')){
    29                     letterCount[left - 'A']++;
    30                 }
    31             }
    32         }
    33         for (char count = 'A'; count <= 'Z'; count++){
    34             System.out.print(count + ": " +
    35                 letterCount[count - 'A'] +
    36                 " ");
    37             if (count == 'M'){
    38                 System.out.println();
    39             }
    40         }
    41         System.out.println();
    42     }
    43 }
    View Code

    输出:

    A: 22 B: 1 C: 4 D: 10 E: 33 F: 7 G: 6 H: 7 I: 18 J: 1 K: 2 L: 10 M: 8
    N: 19 O: 20 P: 2 Q: 1 R: 12 S: 15 T: 20 U: 4 V: 7 W: 6 X: 0 Y: 7 Z: 0

    程序ClassGradeDataBase:使用多维数组存储学生的成绩,第一维是学生编号,第二维是每个学生的成绩。显示全部学生的平均成绩以及每个学生的平均成绩。

     1 package com.jsample;
     2 
     3 import java.util.*;
     4 
     5 public class ClassGradeDataBase {
     6     public static void main(String[] args){
     7         Random generator = new Random();
     8         int[][] dataBase = new int[10][4];
     9         long i = 0;
    10         long sum = 0;
    11         for (int index = 0; index < 10; index++){
    12             dataBase[index][0] = index + 1;
    13             dataBase[index][1] = generator.nextInt()/10000000;
    14             dataBase[index][2] = generator.nextInt()/10000000;
    15             dataBase[index][3] = generator.nextInt()/10000000;
    16             dataBase[index][1] = Math.abs(dataBase[index][1]);
    17             dataBase[index][2] = Math.abs(dataBase[index][2]);
    18             dataBase[index][3] = Math.abs(dataBase[index][3]);
    19             i = (dataBase[index][1] + dataBase[index][2] + dataBase[index][3]);
    20             sum += i;
    21             System.out.println("No."+ dataBase[index][0] + "'s average grades:" + i/3);
    22         }
    23         System.out.println("The average grades of all students:" + sum/30);
    24     }
    25 }
    View Code

    输出:

    No.1's average grades:140
    No.2's average grades:183
    No.3's average grades:103
    No.4's average grades:91
    No.5's average grades:136
    No.6's average grades:136
    No.7's average grades:91
    No.8's average grades:107
    No.9's average grades:127
    No.10's average grades:156
    The average grades of all students:127

    程序Mod13Array:将能被13整除的前400个数存储到数组中。

     1 package com.jsample;
     2 
     3 public class Mod13Array {
     4     public static void main(String[] args){
     5         int[] array = new int [401];
     6         int index = 0;
     7         for(int flag = 1; flag <= 400; index++){
     8             if(index % 13 == 0) {
     9                 flag++;
    10                 array[flag-1] = index;
    11                 System.out.println(index + " ");
    12             }
    13         }
    14     }
    15 }
    View Code

    输出:
    0

    ……

    5187

  • 相关阅读:
    洛谷 3455 (莫比乌斯反演优化)
    HDU 1695 GCD (莫比乌斯反演模板)
    BZOJ 2818 Gcd(欧拉函数+质数筛选)
    欧拉函数(总结)
    Matrix(二维树状数组)入门第一题
    P3919 【模板】可持久化数组(可持久化线段树/平衡树)(入门第一题)
    Color the ball(树状数组区间更新+单点求值)
    快写
    欧拉筛
    D. Magic Breeding
  • 原文地址:https://www.cnblogs.com/redlogic/p/8594243.html
Copyright © 2011-2022 走看看