vaibhav.iit2002
BAN USER{
private static void getCharsCount(String s){
String result = "";
int count = 1;
for(int i = 0; i < s.length(); ++i){
if(i == s.length()-1 || s.charAt(i) != s.charAt(i+1)){
result += "" + s.charAt(i)+count;
count = 1;
}else{
count++;
}
}
System.out.println(result);
}
}
O(n)
{
public int sumNodeLevels(Node node, int level){
if(node != null){
int result = ++level;
// System.out.println("Node - " + node.info + ", " + level);
result += sumNodeLevels(node.left, level);
result += sumNodeLevels(node.right, level);
return result;
}
return 0;
}
}
build heap and then do heapsort > just iterate for k elements and for each element, logn iterations will be made , hence order=k.logn
even if we sort it any other manner and get order as n.logk, k.logn is better as k<=n
awesome reply :P
- vaibhav.iit2002 March 26, 2010