囧死了.....表白了!!!全过程!!!!! (转载)# Love - 情爱幽幽
a*l
1 楼
Can someone help for the questions 2 ?
Thanks in advance.
If you have two arrays of integers:
int[] num = { 2, 101, 33, 8, 77 };
int[] div = { 21, 4, 11 };
1. Write a function that returns true if at least one number in div divides
evenly (ie, with no remainder) into at least one number from num.
2. Can you think of any optimizations? Please describe.
Thanks in advance.
If you have two arrays of integers:
int[] num = { 2, 101, 33, 8, 77 };
int[] div = { 21, 4, 11 };
1. Write a function that returns true if at least one number in div divides
evenly (ie, with no remainder) into at least one number from num.
2. Can you think of any optimizations? Please describe.