PROGRAM TO PRINT MAXIMUM NUMBER OF A'S USING GIVEN FOUR KEYS import java.io.*; class GFG { // A recursive function that returns // the optimal length string for N keystrokes static int findoptimal( int N) { // The optimal string length is N // when N is smaller than 7 if (N <= 6 ) return N; // Initialize result int max = 0 ; // TRY ALL POSSIBLE BREAK-POINTS // For any keystroke N, we need to ...
PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN { public static void main(String args[]) { int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 }; for ( int i = 0 ; i < numRay.length; i++) { numRay[numRay[i] % numRay.length] = numRay[numRay[i] % numRay.length] + numRay.length; } System.out.println( "The repeating elements are : " ); for ( int i = 0 ; i < numRay.length; i++) { if (numRay[i] >= numRay.length* 2 ) { ...
PROGRAM TO FIND FIRST NON-REPEATING CHARACTER IN A STRING IN ONE TRAVERSAL NO_OF_CHARS = 256 # Returns an array of size 256 containg count # of characters in the passed char array def getCharCountArray(string): count = [ 0 ] * NO_OF_CHARS for i in string: count[ ord (i)] + = 1 return count # The function returns index of first non-repeating # character in a string. If all characters are repeating # then returns -1 def firstNonRepeating(string): count = getCharCountArray(string) index = - 1 k = 0 for i in string: if count[ ord (i)] = = 1 : index = k ...
Comments
Post a Comment