java matrix class

Given a m x n Matrix, if an element was 0, set its entire row and column to 0. Do it on place.Problem Solving Ideas:With two Boolean arrays, row col Indicates whether the rows are 0, and the Java implementation is as follows:public void Setzeroes (int[][] matrix) {if (Matrix.length = = 0 | | matrix[0].length = = 0) ret

] = start++;//The directions are all starting from the j=0 direction. - in } -}Else { to intFoot = Num-1; + intFootend = i-num; - the for(intk = 0; K ) { * if(num% 2 = = 1) {//consider sqrt as odd and even-numbered cases $ if(i% 2 = = 1) {//sqrt is odd, I is evenPanax Notoginsengary[foot--][footend++] = start++; -}Else { theary[footend++][foot--] = start++; + } A

System.out.println (); * } $ }Panax Notoginseng}Test Results:　　　2. Arbitrary array transpose1 /**2 * @description arbitrary array transpose3 * @authorOldmonk4 * @time August 18, 20175 */6 Public classTest2 {7 8 Public Static voidMain (String [] args)//Test9 {Ten Double[] Testmatrix = {{1, 22, 34, 22}, {1, 11, 5, 21}, {7, 2, 13, 19 } } ; One Double[] Matrixc = Transpose (Testmatrix, 3, 4) ; A -System.out.println ("-------Transpose before------

serpentine matrix m, clockwise sequential outputCases:Matrix M1 2 3 412 13 14 511 16 15 610 9 8 7Output: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Public Static voidMain (string[] args) {//TODO auto-generated Method Stub int[] m = {{1,2,3,4},{12,13,14,5},{11,16,15,6},{10,9,8,7}}; intn =m.length; intc = m[0].length; if(n = = 1){ for(intA = 0; A a) System.out.print (m[0][a] + ""); } if(c = = 1){ for(intA = 0;

PHP calls the Java class Library through Javabridge and the custom Java class without the package succeeds but calls the custom Java class with the package error, how to solve, ask the big God pointing, thank you.

Package WZS. arithmetics; // question: Calculate the sum of the diagonal elements of a 3*3 matrix. Public class test_wzs26 {public static void main (string [] ARGs) {int array [] [] = {1, 2, 3}, {4, 5, 6}, {7, 8, 9}; system. out. println ("print matrix:"); For (INT I = 0; I Output result: Print matrix: 123456789 pri

I have been reading exercises about arrays over the past few days and found a very interesting question. It is to print the spiral square matrix of N * n and the back-shaped square matrix. For example, for N * n matrices, the output result is as follows: 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9 5 5 5 5 55 4 4 55 4 3 4 55 4 4 55 5 5 5 5 After several hours, the problem finally ended in f

from bottom to topPanax Notoginseng - if(NEndY-1 > Nstart nendx >Nstart) { the System.out.println (); +System.out.println ("Print a column from bottom to top"); A for(intp = nEndY-1; P >= Nstart + 1; p--) { theSystem.out.print (Narr[p][nstart] + "\ T"); + } - } $ $ } - - Public Static voidPrintint[] Narr,intRowsintcolumns) { the if(Narr = =NULL|| Rows ) { - return;Wuyi } the intNstart = 0; -

Java two-dimensional array matrix multiplication implementation method, two-dimensional array Multiplication Copy codeThe Code is as follows:Public interface IMatrixMultiple {Public int [] [] mmltiple (int [] [] a, int [] [] B );}? Public class MatrixMultiple implements IMatrixMultiple {@ OverridePublic int [] [] mmltiple (int [] [] a, int [] [] B ){Int [] [] res

For example:A B C D E F G H I J K L M N O P Q R S T U V W X Y E D J C I O B H N T A G M S Y F L R X K Q W P V U Ideas such as:Outside the diamond is a space, within the diamond (can use function to judge) There are two kinds of points, one is a character, one is a spaceIt can be found that there is a character position (col-row)%2 = = 0; next look for a 45 degree diamond and rectangle correspondence, row ' = (col-row)/2, col ' =col-row 'The complete code is as foll

The program code is as follows:Implementation of packagechapter02;importjava.util.arrays;/** matrix transpose (simple version) */publicclass Ch02_04{publicstaticvoidmain (String[]args) {int[][]arr={{ 1,2,3},{4,5,6},{7,8,9}};introws=arr.length;intcols =arr[0].length;int[][]arrresult=newint[cols][rows];//fill result array for (inti =0;iThe results of the implementation are as follows:[1, 2, 3] [4, 5, 6] [7, 8, 9] [1, 4, 7] [2, 5, 8] [3, 6, 9]This articl

1 //The Magic matrix is incremented by default from the upper-right corner 45 degrees2 //@ Overland--595128841 in qq dot com3 //import java.util.Arrays;//for printing API functions4 Public classRubik's Cube matrix5 {6 Public Static voidMain (string[] args)7 {8 intn = 7;9 intA =0;Ten intb = (n-1)/2; One int[] arr =New int[n][n]; A for(inti=1;i) - { - if(i==1) the { -Arr[

Given an integer n, generate a square matrix filled with elements from 1 to n2 in Spiral order.For example,Given N = 3 ,You should return the following matrix:[[1, 2, 3], [8, 9, 4], [7, 6, 5]]1 Public classSolution {2 Public int[] Generatematrix (intN) {3 intStartX = 0,starty = 0,endx = N-1,endy = n-1;4 int[] ans =New int[n][n];5 intCount = 1;6 while(StartX Endy) {7

A passage in Java programming thought:When writing a Java source code file, this file is often referred to as a compilation unit (sometimes referred to as a translation unit). Each compilation unit must have a suffix name. java, and within the compilation unit you can have a public class that has the same name as the f

In fact, a two-dimensional data is a matrix, the effect here is a two-dimensional array clockwise rotation to save as a listListChar[][] Lines=new char[m][n];//char[][] should be an already instantiated array with content, I'm here m>nfor (int i=0;ifor (int j=lines.length-1;j>=0;j--) {List.add (Lines[j][i]);}}Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.The inverse of the

The key is to implement the algorithm, so the code is written in the main program, the program code is as follows:Implementation of packagechapter02;importjava.util.arrays;/** matrix multiplication (simple version) */publicclass Ch02_03{publicstaticvoidmain (String[]args) {int[][]arr1={ {3,3,3},{5,5,5}};int[][]arr2={{1,2},{3,4},{5,6}};/ /define and populate the array that holds the result int[][]arrresult=newint[2][2];for (inti=0;i The results of the

In fact, this program is the first sophomore semester in Java, a normal job, at that time only required to produce a few random matrices and the calculation of these matrices.So I didn't go to the present so rich and practical function. But at that time was quite want to do, but some do not know how to achieve.Now is the junior semester, before soon after the end of the exam, idle to the matter before the fall of this thing to fill up, but also a big

Public classLX { Public Static voidMain (string[] args) {int[] c=New int[20] [20]; intI,j,k=1; for(i=0;i) { for(j=i;j) {C[i][j]=k++; } for(j=i+1;j) {c[j][7-i-1]=k++; } for(j=7-2-i;j>=0;j--) {c[7-i-1][j]=k++; } for(j=7-2-i;j>i;j--) {C[j][i]=k++; } } for(i=0;i) { for(j=0;j) {System.out.print ("\ T" +c[i][j]+ ""); } System.out.println (); } }}Spiral Matrix

SMARTOJ[NOIP1995P3]Import java.util.*;public class Main{public static void Main (string[] args) {String str =null;Scanner Scanner = new Scanner (system.in);int n = scanner.nextint ();int[][] numbers = new Int[n][n];boolean[][] IsE = new Boolean[n][n];int x=0,y=n-1,k=1;numbers[x][y]=k++;Ise[x][y] = true;while (kwhile (xx + +;numbers[x][y]=k++;Ise[x][y] = true;}while (y>0 !ise[x][y-1]) {y--;numbers[x][y]=k++;Ise[x][y] = true;}while (x>0 !ise[x-1][y]) {x

Java multithreading BASICS (2) Timer class: Timer class and TimerTask class, timertimertask classJava multithreading BASICS (2) Timer class: Timer class and TimerTask class Timer