Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- * To change this license header, choose License Headers in Project Properties.
- * To change this template file, choose Tools | Templates
- * and open the template in the editor.
- */
- package javacore_season5_exercise3;
- import java.util.Scanner;
- /**
- *
- * @author HuyLV
- */
- public class Exercise3 {
- public static int n;
- public static int[] arr;
- /**
- * @param args the command line arguments
- */
- public static void main(String[] args) {
- // TODO code application logic here
- input();
- System.out.println("Original Array:");
- for (int value : arr) {
- System.out.print(value + "\t");
- }
- System.out.println();
- findMaxNumber(arr);
- System.out.println();
- System.out.println("Decreasing Array:");
- decreasing(arr);
- for (int i = 0; i < arr.length; i++) {
- if (arr[i] < 0) {
- arr[i] = 0;
- }
- System.out.print(arr[i] + "\t");
- }
- System.out.println("-------------Input Number-------------");
- inputMember(arr);
- }
- private static void input() {
- Scanner scanner = new Scanner(System.in);
- System.out.print("Nhap n phan tu cua mang: ");
- n = scanner.nextInt();
- arr = new int[n];
- for (int i = 0; i < arr.length; i++) {
- System.out.print("Nhap phan tu o vi tri " + i + " : ");
- arr[i] = scanner.nextInt();
- while (arr[i] < 0 || arr[i] > 100) {
- System.out.printf("Hay nhap lai phan tu thu %d (0 < phantu < 100): ", i);
- arr[i] = scanner.nextInt();
- }
- }
- }
- public static void findMaxNumber(int[] arr) {
- int total = 0;
- int index = 0;
- for (int value : arr) {
- total += value;
- }
- int max = arr[0];
- int temp = total - arr[0];
- for (int i = 1; i < arr.length; i++) {
- int result = total - arr[i];
- if (result < temp) {
- temp = result;
- max = arr[i];
- index = i;
- }
- }
- System.out.printf("So lon nhat: %d\t tai vi tri: %d\n", max, index);
- }
- public static int[] decreasing(int[] arr) {
- int temp;
- for (int i = 0; i < arr.length; i++) {
- for (int j = i; j > 0; j--) {
- if (arr[j] > arr[j - 1]) {
- temp = arr[j];
- arr[j] = arr[j - 1];
- arr[j - 1] = temp;
- }
- }
- }
- return arr;
- }
- public static void inputMember(int[] arr) {
- Scanner scanner = new Scanner(System.in);
- System.out.print("Hay nhap vao 1 so: ");
- int number = scanner.nextInt();
- int[] result = new int[arr.length + 1];
- for (int i = 0; i < result.length; i++) {
- // cach 1
- if(i < result.length - 1){
- result[i] = arr[i];
- } else{
- result[i] = number;
- }
- //
- /* Cach 2
- boolean isAdded = false;
- if (!isAdded) {
- if (i < arr.length) {
- if (arr[i] > number) {
- result[i] = arr[i];
- } else {
- result[i] = number;
- isAdded = true;
- }
- } else {
- result[i] = number;
- }
- } else {
- result[i] = arr[i - 1];
- }
- */
- }
- decreasing(result);
- for (int i = 0; i < result.length; i++) {
- System.out.print(result[i] + "\t");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement