Amarkant Kumar
BAN USERimport java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class wordSequence {
/**
* @author: Amarkant kumar ,DUCS
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String[] data = {"cat","dog","act","god","tac"};
processData(data);
}
private static void processData(String[] data) {
Map<Integer,List<String>> obj = new HashMap<>();
for(int i=0;i<data.length;i++)
{
int a=0;
String s = data[i];
for(int j=0;j<s.length();j++)
{
a+=(int)s.charAt(j);
}
if(obj.size()==0)
{
obj.put(a, new ArrayList<String>());
obj.get(a).add(data[i]);
}
else
{
if(obj.get(a) == null)
{
obj.put(a, new ArrayList<String>());
obj.get(a).add(data[i]);
}
else
{
obj.get(a).add(data[i]);
}
}
}
System.out.println(obj.values());
}
}
/*
* Output: [[cat, act, tac], [dog, god]]
*
* */
public interface A {
void m();
}
public interface B {
void m();
}
public class mainTest {
public static void main(String []args)
{
Test t = new Test();
t.m();
}
}
public class Test implements A,B {
@Override
public void m() {
// TODO Auto-generated method stub
System.out.println("University Of Delhi , India");
}
}
n1 n2 n3 n4 n5 n6 n7 n8
n1 n3 n5 n7
n1 n5
n1 ( winner)
can use max heap : who will match would be at root node so at the last winner to be at root
node .
- Amarkant Kumar March 10, 2013