2darray identify part of array and add its value to total

[Mark Hughes]

Hey guys,
have a 2darray which looks like;
circle red 0.2
square green 1.1
circle blue 2.0

Now i can search the array for say shape circle, but i also want to total the value of circle so above will become 2.2 when added up, at the moment my code just total the number of circle so above would be 2 circles, can some one please show me how i might edit my code to total value opposed to how many;

int totCircle = 0;
nt totSquare = 0;
int totLine = 0;
String Square = "square";
for (int numRow=0; numRow < lines2.length; numRow++) {
  for (int numCol=0; numCol < lines2[numRow].length; numCol++) {
     System.out.print(lines2[numRow][numCol] + " ");
  if (lines2[numRow][numCol].toString().contains("circle")) {
  totCircle = totCircle + 1;
  }
  else if (Square.equals(lines2[numRow][numCol])) {
   totSquare = totSquare + 1;
  }
          else if (lines2[numRow][numCol].toString().contains("line")) {
  totLine = totLine + 1;
  }
  
  }
  System.out.print("\n");
  }
  System.out.print(+totCircle+ " and " +totSquare+ " and " +totLine);
  

do you think i would have to put some kind of for loop within my if statement to total value of circle or square ect.

Thanks
mark

[pascal betz]

hey

is the order fixed (is it always "shape", "color", "value") ?

if yes, then you can simplify your code. i give you some code parts below which hopefully get you started....

...
// define the index as "constants" so there is only one place to change them
public static final int INDEX_SHAPE = 0;
public static final int INDEX_COLOR = 1;
public static final int INDEX_VALUE = 2;
....
 
// assuming you have an String[][]
public void doTheWork(String[][] array) {
  int totCircle = 0:
  for (int i = 0; i < array.length; i++) {
    if (array[i][INDEX_SHAPE].contains("circle")) {
      totCircle = totCircle + Double.parseDouble(array[i][INDEX_VALUE]);
    } else if (...) { // next shape
    
    } else if (...) // next shape and so on
  }
}

pascal

[Mark Hughes]

that looks pretty cool thanks ill try that