This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.LinkedList; | |
| public class LinkedListQ3 { | |
| static int compareList(LinkedList<String> c1, LinkedList<String> c2) { | |
| int matchCount = 0, misMatchCount = 0, differenceCount = 0; | |
| if (c1.size() == c2.size()) { | |
| // int mis_matchcount = 0; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package exercise; | |
| public class StringPatternMatching { | |
| static String str = "AAABBCCAA";//AAABBCCAA ->A3B2C2A2 //A3B2C2B2C2D2 | |
| static String distinct = ""; | |
| static char[] charary = str.toCharArray(); | |
| static StringBuilder hello = new StringBuilder(""); | |
| //static StringBuilder finalResult = new StringBuilder(""); | |
| static char[] tempcharary = new char[charary.length]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.LinkedList; | |
| public class LinkedListExample{ | |
| static int compareList(LinkedList<String> c1, LinkedList<String> c2) { | |
| int matchCount =0, misMatchCount = 0; | |
| int differenceCount; | |
| if(c1.size() >= c2.size()) { | |
| for(String str : c1) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| https://github.com/etsy/AndroidStaggeredGrid |