We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Electronics Shop
  5. Discussions

Electronics Shop

  • j_advani
     + 5 comments

    Just with a double for-iteration in Java works already... Using sort functions makes internally more loop operations to reorder each array. 

    static int getMoneySpent(int[] keyboards, int[] drives, int budget) {
		int max = -1;

		for (int i = 0; i < keyboards.length; i++) {
			for (int j = 0; j < drives.length; j++) {
				if (keyboards[i] + drives[j] <= budget && keyboards[i] + drives[j] > max)
					max = keyboards[i] + drives[j];
			}
		}
		return max;
	}