Thread: Beginner pleasee help with java code

Restriction the only structure my program is allowed to use for storage, is ArrayLists.
The link to the problem I'm trying to solve is Powered by Google Docs

So far what i got is this,(note that im not putting in the ";" yet)
____________________

import sdsu.io.*;
import java.util.*;
public class Problem
{
 
 
public static void main(String args[])
{
 
   ArrayList<String>[] list = new ArrayList[23];
   for (int i=0; i<=22; i++)
   {
      list[i] = new ArrayList<String>();
   }
 
   for (int i = -999; i <= 999; i++)
   {
        int count = 0;
 
        for(int k = 0; k <= 2; k++)
        { int a = s.charAt(k);
 
        if(a == -){count++}
        if else(a == 0){count = count + 6}
        if else(a == 1){count = count + 2}
        if else(a == 2)[count = count + 5}
        if else(a == 3){count = count + 5}
        if else(a == 4){count = count + 4}
        if else(a == 5){count = count + 5}
        if else(a == 6){count = count + 6}
        if else(a == 7){count = count + 3}
        if else(a == 8){count = count + 7}
        if else(a == 9){count = count + 6}
 
        }
 
   int k1 = Console.readline("Input X'a milliamps:");
   int k2 = Console.readline("Input Y's milliamps:");
   int k3 = Console.readline("Input Z's milliamps");
 
   k1 = k1 / 5
   k2 = k2 / 5
   k3 = k3 / 5;
 
   int count = 0;
 
 
   //* HERE:
   //  Use the k1, k2, k3, list[], etc., to examine and compute
   //  possible combinations for "X Op Y = Z", but use list[] to shortcut
   //  your combinations so your program will not examine all 31 billion.
 
   System.out.println("Possible solutions = " + count);
 
} //end main
 
 
 
public static int calcsegments(int i)
{
   //* HERE:
   //  Compute and return the number of segments in the number i,
   //  where i is of course something in the range -999 to 999.
}  
 
 
 
} //end class

i basically need help on the parts with the "*Here" on it. I think the rest is correct but i really dont know how to count all possible combinations depending on the number they enter for k1, k2, k3

Originally Posted by chuy525

Restriction the only structure my program is allowed to use for storage, is ArrayLists.

So far what i got is this,(note that im not putting in the ";" yet)
____________________

import sdsu.io.*;
import java.util.*;
public class Problem
{
 
 
public static void main(String args[])
{
 
   ArrayList<String>[] list = new ArrayList[23]; //<--- what is this?
   for (int i=0; i<=22; i++)
   {
      list[i] = new ArrayList<String>();//<<--- 
/*I know what your trying to do here, I am not sure this is the approach.*/
   }
 
   //* HERE:
   //  Use the k1, k2, k3, list[], etc., to examine and compute
   //  possible combinations for "X Op Y = Z", but use list[] to shortcut
   //  your combinations so your program will not examine all 31 billion.
 
   System.out.println("Possible solutions = " + count);
/*<--- think that your possible solution is the short cut? idea not solution. primitive array String[] str  can access --> str[count]  ???  */
 
 
   //* HERE:
   //  Compute and return the number of segments in the number i,
   //  where i is of course something in the range -999 to 999.

i basically need help on the parts with the "*Here" on it. I think the rest is correct but i really dont know how to count all possible combinations depending on the number they enter for k1, k2, k3

First review this ArrayList and array first

then comeback with your probabilities. You need to figure the probability math some links for it.