telivison
Some of ways to solve this problem is to use four nested loops for().Something like following:...const int limit = 1000;//some code herefor (int i(0); i
for (int i = 0;i < nme.length() ;i++ ) { n[i] = nme.charAt(i); } for (int j=0;j < lnme.length() ;j++ ) { l[j] = lnme.charAt(j); } for (int i = 0;i < nme.length() ;i++ ) { for (int j=0;j < lnme.length() ;j++ ){ if(n[i] == l[j]){ n[i] = ' '; l[j]=' '; } } } int C = 0; for (int i = 0;i < nme.length() ;i++ ) { if(n[i] != ' ' ){ C ++; } } for (int j=0;j < lnme.length() ;j++ ) { if(l[j] != ' ' ){ C ++; } } refer this site for full coding: http://shamjeet.blogspot.in/p/java-se.html#c
#include<stdio.h> #include<string.h> int max(int a,int b) { return a>b?a:b; }//end max() int main() { char a[]="xyxxzxyzxy"; char b[]="zxzyyzxxyxxz"; int n = strlen(a); int m = strlen(b); int i,j; for(i=n;i>=1;i--) a[i] = a[i-1]; for(i=m;i>=1;i--) b[i] = b[i-1]; int l[n+1][m+1]; printf("\n\t"); for(i=0;i<=n;i++) { for(j=0;j<=m;j++) { if(i==0 j==0) l[i][j]=0; else if(a[i] == b[j] ) l[i][j] = l[i-1][j-1] + 1; else l[i][j] = max(l[i][j-1],l[i-1][j]); printf("%d |",l[i][j]); } printf("\n\t"); } printf("Length of Longest Common Subsequence = %d\n",l[n][m]); return 0; }
Stephen J. Poplawski invented the blender in 1922
#include<stdio.h> #include<conio.h> void main() { int i,j,k=0,l; clrscr(); for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { k++; printf("%d ",k%2); } for(l=i;l<=4;l++) { k++; } printf("\n"); } getch(); }
Patricia. J. Spencer, Carrie .P. DeRoeck, Robert .L. DeRoeck
L. J. Hanifan died in 1932.
J. L. Moreno has written: 'Postcard of J. L. Moreno' -- subject(s): Correspondence
J. L. Manning was born in 1914.
L. J. Hooker was created in 1928.
L. J. Manogue was born in 1875.
L. J. Manogue died in 1925.
L. J. Greenberg died in 1931.
L. J. Greenberg was born in 1861.
J. L. Reveal was born in 1941.
L. J. Davis died in 2011.
L. J. Davis was born in 1941.