@Rajeev..there is the fault.....for 55554, there can be 2 excellent groups..
55 55 54 therefore, quality = 2*2 = 4 which is highest... On 7/8/11, rajeev bharshetty <rajeevr...@gmail.com> wrote: > It scans 555 count=3(excellent group) it will put in one group than 54 > since the count is one puts that in usual group quality =2*1 =2 , > > On Fri, Jul 8, 2011 at 1:28 AM, Piyush Sinha > <ecstasy.piy...@gmail.com>wrote: > >> @Rajeev...check ur logic for 55554 >> >> On 7/8/11, rajeev bharshetty <rajeevr...@gmail.com> wrote: >> > So, I think first check for excellent groups then good and then usual to >> > increase the quality. >> > So to get excellent groups scan the string and keep a count of the >> > contagious repeating elements ,if count==3 or count==2,then put in one >> > group >> > The same procedure for good and usual accord to constraints . >> > >> > >> > >> > On Thu, Jul 7, 2011 at 11:46 PM, Piyush Sinha >> > <ecstasy.piy...@gmail.com>wrote: >> > >> >> You are given a String number containing the digits of a phone number >> >> (the number of digits, n, can be any positive integer) . To help you >> >> memorize the number, you want to divide it into groups of contiguous >> >> digits. Each group must contain exactly 2 or 3 digits. There are three >> >> kinds of groups: >> >> • Excellent: A group that contains only the same digits. For example, >> 000 >> >> or 77. >> >> • Good: A group of 3 digits, 2 of which are the same. For example, >> >> 030, 229 or 166. >> >> • Usual: A group in which all the digits are distinct. For example, 123 >> or >> >> 90. >> >> The quality of a group assignment is defined as 2 × (number of >> >> excellent groups) + (number of good groups) >> >> Divide the number into groups such that the quality is maximized. >> >> Design an efficient >> >> algorithm to return the solution that maximizes the quality. >> >> >> >> -- >> >> *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 algogeeks@googlegroups.com. >> >> To unsubscribe from this group, send email to >> >> algogeeks+unsubscr...@googlegroups.com. >> >> 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 algogeeks@googlegroups.com. >> > To unsubscribe from this group, send email to >> > algogeeks+unsubscr...@googlegroups.com. >> > 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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
