@radha, i think your solution is wrong. for this case: 101,10 in your solution , the ans is 10101,but the max ans is 10110.
2011/5/27 radha krishnan <[email protected]> > 10100 is max ans > okay > convert the numbers to strings and sort based on the first character > !!!!!!! > if equal do that recursively and then if length is less give that > preference !! > i think this solution .. > may be this is wrong !! > > On Fri, May 27, 2011 at 7:07 PM, wujin chen <[email protected]>wrote: > >> @Piyush， how to deal with this case :100 , 10 >> >> >> 2011/5/27 Piyush Sinha <[email protected]> >> >>> we can work out if we sort according to the leftmost integer >>> >>> On 5/27/11, [email protected] <[email protected]> wrote: >>> > are you kidding me. Just simple sort wont work. >>> > >>> > On Fri, May 27, 2011 at 9:31 AM, radha krishnan < >>> > [email protected]> wrote: >>> > >>> >> sort :) >>> >> >>> >> >>> >> On Fri, May 27, 2011 at 6:57 PM, ross <[email protected]> wrote: >>> >> >>> >>> Hi all, >>> >>> >>> >>> Given an array of elements find the largest possible number that can >>> >>> be formed by using the elements of the array. >>> >>> >>> >>> eg: 10 9 >>> >>> ans: 910 >>> >>> >>> >>> 2 3 5 78 >>> >>> >>> >>> ans: 78532 >>> >>> >>> >>> 100 9 >>> >>> >>> >>> ans: 9100 >>> >>> >>> >>> -- >>> >>> You received this message because you are subscribed to the Google >>> Groups >>> >>> "Algorithm Geeks" group. >>> >>> To post to this group, send email to [email protected]. >>> >>> To unsubscribe from this group, send email to >>> >>> [email protected]. >>> >>> For more options, visit this group at >>> >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >>> >>> >>> >> -- >>> >> You received this message because you are subscribed to the Google >>> Groups >>> >> "Algorithm Geeks" group. >>> >> To post to this group, send email to [email protected]. >>> >> To unsubscribe from this group, send email to >>> >> [email protected]. >>> >> For more options, visit this group at >>> >> http://groups.google.com/group/algogeeks?hl=en. >>> >> >>> > >>> > -- >>> > You received this message because you are subscribed to the Google >>> Groups >>> > "Algorithm Geeks" group. >>> > To post to this group, send email to [email protected]. >>> > To unsubscribe from this group, send email to >>> > [email protected]. >>> > For more options, visit this group at >>> > http://groups.google.com/group/algogeeks?hl=en. >>> > >>> > >>> >>> >>> -- >>> *Piyush Sinha* >>> *IIIT, Allahabad* >>> *+91-8792136657* >>> *+91-7483122727* >>> *https://www.facebook.com/profile.php?id=100000655377926 * >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
