I am writing a Java permutation program, it takes in N and k and gives k amount of combinations based on N length.
That portion works, but the portion I have that does not work is when k is greater then 1, the array is then then printing strings out of index.
The perm algorithm ends on index - 1 for moving characters but then I push all those characters into an Array List, I would think I could print them off however I want from there but that is not the case. I'll include the minimum amount of code possible.
//permString = 1234 or something, it doesn't matter //Use Case N = 4 k = 3, prints out 123,124,132,134 ect //Use Case N = 4 k = 2, error index out of range but only on the printing function; the perm function doesn't take k and //is based on length //the "" is just an empty string permNow("", permString); }
I am learning while loops but the output I am getting is not what I want? My class:
public class BottlesOnWall { public static void main (String[] args) { int x = 99; while (x > 1) { System.out.println(x + " bottles on the wall!");
[Code] .....
The output I am getting is this:
99 bottles on the wall! 98 bottles on the wall! 97 bottles on the wall! 96 bottles on the wall! 95 bottles on the wall!
[Code] ....
I want it to stop on "2 bottles on the wall!" and then print "Only 1 bottle left on the wall!". How do I go about doing that? I have tried different variations of the condition (x>1), I have tried (x>5) but it still goes down to 1 bottle?
I have a for cycle in which I have a line for printing in the output file. But the file remains empty.
I inserted ShowMessageDialog in the same cycle in order to see what are the results of the calculations that are supposed to appear in the output file, and I see that the results are fine.
WAP which takes two string as input from the user (a & b).This prog should print two strings as output (a1 & b1).
(a1) should contain all the characters which are present in (a).but not present in (b). (b1)should contains all the characters which are present in (b).but not present in(a).
I am receiving an ArrayIndexOutOfBoundsException for the following code, which moves a creature through a 2D array maze. I have altered the clauses of the first if statement for the four direct methods (north, south, east, and west) multiple times (i.e. x + 1 >= 0 && x > 0 && x - 1 > 0 && x < array.length...etc). However, while the code occasionally runs, more often than that it returns this exception. Catching the exception seems like a poor workaround though if worst comes to worst I'll do that.
I included only the relevant functions of the code:
public boolean goNorth(char[][] array) { boolean success = true;; x = getX(); //x = this.x; y = getY(); //y = this.y; if ((x - 1 >= 0 && x - 1 < array.length) && (y >= 0 && y < array[x].length)) {
I searched online for this error and found out it's because the array is smaller than the index but I am not sure how I can fix this error....
public Lamborghini[] getCarsWithHorsepowerRange(double lowHP, double highHP){ int i = DEFAULT_ZERO; Lamborghini[] carWithinHPRange = new Lamborghini[i]; for (Lamborghini lambos : inventory){ double horsePower = lambos.getHorsepower();
[Code] ....
I tried
Lamborghini[] carWithinHPRange = new Lamborghini[i+5];
//which works sometimes because once I boost up the range and so there'll be more result then the error came up again....
My project was to create an array holding 10 integers and populate the array with 10 random numbers. Then ask the user to guess the number. Prompt the user with a while loop if their input is out of range. Determine if the users number is in the array, and display which index location the number is in. I got most of the code done but am having trouble displaying the index location.
import javax.swing.*; public class Homework4 { public static void main(String[] args) { int[] numarray = new int [10]; char repeatcode = 'y';
I am trying to make different arrays each being filled with random numbers from 0 to 2000, however when I run this code I get the error mentioned in the header. here is part of my code
for (int i = 1; i <= 14; i++) { int n = (int) Math.pow(2, i); int[] list = new int[n]; for( int j = 0; j <= list.length; j++){ list[j] = (int) (Math.random() * 2000); } }
I want to find a certain element in array I have to scan through the array index starting from 0 until I find the number I am looking for. Even in data structures which use hashing like HashMap and Hashtable we will have to scan through the keys until we find the key we are looking for. So what is the use of hashing over index based searching? I mean how is hashing an advantage over an array?
I am getting error array index out of bound ... Error detail is :
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 0 at abhiExample.arraytwodiam.main(arraytwodiam.java:27 )
And program is
Java Code:
package abhiExample; import java.util.Scanner; public class arraytwodiam { public static void main(String [] args) { char[][] Atrace={}; int i,j,k,l=0,row ,characters;
I'm trying to iterate through an array of integers and find the start position of the part of the array containing the most consecutive 1s.
For example given the array {1,3,1,1,1,1,5,3,2,1,1}, the method should return 2 and given {1,4,5,1,1,1,5,1} the method should return 3.
So far, I've managed to retrieve the element where the consecutive 1s begin. However, I'm unsure how to get the index of this element and this implementation doesn't work if there is more than one set of consecutive 1s.
public class GetIndex { public static int getPosition(int[] myArray) { int index = 0; int tracker = 0; int mostOnes = 0; for(int i = 0; i < myArray.length; i++) {
class test{//class public static void main(String[]args) { String booking [][]= new String [30] [6] ;//two dimensional array System.out.println("Enter the seat column you want");//column entry char column=Keyboard.readChar(); System.out.println("Enter the seat row you want");//row entry int row=Keyboard.readInt();
I am trying to understand the following code.This return statement should actually return the char at myArray[index] first, then increments the index afterwords correct?
What program needs to find is the most biggest number. It does the job, but another task of the program is to find the index of that number . The second loop should do just that, but for some reason, as the loop goes further, it passes through the if statement even though answer "a[i]" is not equal to "answer". The idea is that if a[i] and answer are equal, the "i" should represent the index number.
import java.util.*; public class DungeonsAndDragonsRedux { public static void main(String[] args) { Scanner s = new Scanner (System.in); Scanner t = new Scanner (System.in); t.useDelimiter("\n"); // Prevent scanner from reading code after nextLine().
[code]...
I have this program that is attempting to randomly equip the player with items that are randomly chosen from a list. I don't know how to prevent it from picking the same item twice though. I also don't know how to display the items that haven't been equipped, which is another requirement of this program.
I'm making a program with several functions for an array of integers, one being to find the last occurrence of a given integer and returning it. The problem is that the method is returning -1 for every input, even though it's only supposed to do so for numbers not in the array. Here's the part of my code with the sections I'm having an issue with:
Driver
import java.util.Arrays; public class ArrayMethodsDriver { public static void main(String[] args) { int[] a = {7,8,8,3,4,9,8,7}; System.out.println("Last index of 8: " + ArrayMethods.findLast(a, 8)); System.out.println("Last index of 2: " + ArrayMethods.findLast(a, 2));
[Code] ....
As you can see, I'm testing 8(which should give a 6) and 2(which should give -1 because it's not in the array), and 4(which should give 4). The print statements all say -1.
I have a 2-D character array and I was wondering if I can compare a given index to an out of bounds index and what would I have to write? For instance
if(array[0 - 1][0 - 1] == 'indexoutofbounds'){ **// I know that 'indexoutofbounds' is probably not the right wording** stuff happens }
If I can do this what would I actually have to write in where it says 'indexoutofbound' ?
I will be using this for many indexes so it wont always be [0 - 1][0 - 1] it could be [4 - 1][3 - 1] in which case it wouldn't be out of bounds and wouldn't move onto "stuff happens"....