Skip to content

Instantly share code, notes, and snippets.

@stphung
Created April 16, 2011 18:07
Show Gist options
  • Select an option

  • Save stphung/923358 to your computer and use it in GitHub Desktop.

Select an option

Save stphung/923358 to your computer and use it in GitHub Desktop.
TopCoder SRM 503 Division 2 - 500 point problem
import java.util.Arrays;
public class ToastXToast {
public int bake(int[] undertoasted, int[] overtoasted) {
Arrays.sort(undertoasted);
Arrays.sort(overtoasted);
if (undertoasted[0] > overtoasted[0] || undertoasted[undertoasted.length - 1] > overtoasted[overtoasted.length - 1]) {
return -1;
} else if (undertoasted[undertoasted.length - 1] < overtoasted[0]) {
return 1;
}
return 2;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment