implement atoi function
Write your own C program to implement the atoi() function
[AMAZON] Vertical sum of nodes
Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
int myatoi(const char *string)
ReplyDelete{
int i;
i=0;
while(*string && (*string <= '9' && *string >= '0'))
{
i=(i<<3) + (i<<1) + (*string - '0');
string++;
// Dont increment i!
}
return(i);
}
does (i<<3)+(i<<1) have any advantage over multiplying i with 10? or is it just another logic?
ReplyDeleteyes bitwise operation is faster than normal multiplication...
ReplyDelete