-
Notifications
You must be signed in to change notification settings - Fork 0
“““homework 20201021” #1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
withjiang
wants to merge
1
commit into
main
Choose a base branch
from
homework-10.21
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,30 @@ | ||
| public class counts{ | ||
| public static void main(String[] args){ | ||
| int [] numbers = new int[100]; | ||
| int [] counts = new int[10]; | ||
|
|
||
| for(int i = 0; i<numbers.length; i++){ | ||
| numbers[i] = (int)(Math.random()*10); | ||
| System.out.print(numbers[i]); | ||
| } | ||
| System.out.print("\n"); | ||
| System.out.println("each numbers is occur: \n"); | ||
|
|
||
| int count = 0; | ||
| for(int k =0; k< counts.length;k++) { | ||
| for(int i = 0; i<numbers.length; i++){ | ||
| if(k == numbers[i]) | ||
| count++; | ||
| } | ||
| counts[k] = count; | ||
| count = 0; | ||
| } | ||
|
|
||
| for(int k = 0; k< counts.length; k ++) | ||
| System.out.println(k + ":"+counts[k]); | ||
|
|
||
|
|
||
| } | ||
| } | ||
|
|
||
|
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| import java.util.Scanner; | ||
| public class printMatrix{ | ||
| public static void main(String[] args){ | ||
| Scanner scan = new Scanner(System.in); | ||
| System.out.println("������һ������n"); | ||
| int n = scan . nextInt(); | ||
| printMatrix(n); | ||
| } | ||
| public static void printMatrix(int n ){ | ||
| int i , j; | ||
| for(i =0; i< n ; i++){ | ||
| for(j=0;j< n;j++){ | ||
| int a = (int)((Math.random()*15)/10); | ||
| System.out.print(a); | ||
| } | ||
| System.out.print("\n"); | ||
| } | ||
| } | ||
|
|
||
|
|
||
|
|
||
|
|
||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,24 @@ | ||
| import java.util.Scanner; | ||
| public class reverse{ | ||
| public static void main(String[] args){ | ||
| Scanner scan = new Scanner(System.in); | ||
| System.out.println("������һ������"); | ||
| int number = scan . nextInt(); | ||
| reverse(number); | ||
| } | ||
| public static void reverse(int number){ | ||
| int a = 0; | ||
| if(number< 0 ){ | ||
| System.out.println("�Ƿ�����!"); | ||
| } | ||
| else{ | ||
| while(number > 0){ | ||
| a = number % 10; | ||
| number = number/ 10; | ||
| System.out.print( a ); | ||
| } | ||
|
|
||
| } | ||
|
|
||
| } | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| import java.util.Scanner; | ||
| public class sumMatrix{ | ||
| public static void main(String[] args){ | ||
| System.out.println("import:"); | ||
| Scanner scan = new Scanner(System.in); | ||
| int n = scan.nextInt(); | ||
| double[][] matrix = new double[n][n]; | ||
| for(int i = 0;i<matrix.length ; i++){ | ||
| for(int j = 0; j < matrix[i].length; j++){ | ||
| matrix[i][j] = (int)(Math.random()* 100); | ||
| System.out.print(matrix[i][j]+" "); | ||
| } | ||
| System.out.print("\n"); | ||
| } | ||
| System.out.println("sum of these elements is:"); | ||
| double sum = 0; | ||
| for( int i = 0; i < matrix.length;i++){ | ||
| for(int j = 0; j < matrix[i].length;j++){ | ||
| if (i == j){ | ||
| double elem = matrix[i][j]; | ||
| sum = sum + elem; | ||
|
|
||
| } | ||
| } | ||
|
|
||
| } | ||
| System.out.println(sum ); | ||
|
|
||
| } | ||
|
|
||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,30 @@ | ||
| import java.util .Scanner; | ||
| public class temp{ | ||
| public static void main(String[] args){ | ||
| System.out.println("������10������"); | ||
| Scanner scan = new Scanner(System.in); | ||
| double[ ] array = new double[10]; | ||
| for(int i = 0 ; i<10 ; i++) { | ||
| double n = scan.nextDouble(); | ||
| array[i] = n; | ||
| } | ||
| for(int i = 0; i< array.length;i++){ | ||
| System.out.print(array[i]+ " "); | ||
| } | ||
| System.out.println( indexOfSmallestElement(array)); | ||
| } | ||
|
|
||
| public static int indexOfSmallestElement(double [] array){ | ||
| double min = array[0]; | ||
| int index = 0; | ||
| for(int i = 0; i< array.length;i++){ | ||
| if(array[i]< min){ | ||
| min = array[i]; | ||
| index = i; | ||
| } | ||
|
|
||
|
|
||
| } | ||
| return index; | ||
| } | ||
| } |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
scan没有close,以及字符编码可能有点问题,建议最好用utf-8