ya, it is correct, i misunderstood it..
any optimization on the same though ?
On Fri, Dec 28, 2012 at 9:55 AM, shady sinv...@gmail.com wrote:
@ritesh
umm, well here's a simple testcase to show the problem in the code..
isMatch(aa, a*)
On Thu, Dec 27, 2012 at 7:17 PM, Ritesh Mishra
i was asked the same question in my Microsoft interview.
I gave the solution using a naive method by comparing each letter and
tracking the next character.
If the next character is *, then set a flag and check the equality,
and if it is a . ignore and move on.
He was ok with the solution but said
@shady : look for the implementation of Matcher class.. may be that could
help .
On Sun, Dec 23, 2012 at 11:01 PM, shady sinv...@gmail.com wrote:
that's the point, Have to implement it from scratch... otherwise java has
regex and matcher, pattern to solve it...
On Sun, Dec 23, 2012
try to solve it by recursion ..
http://www.leetcode.com/2011/09/regular-expression-matching.html
Regards,
Ritesh Kumar Mishra
Information Technology
Third Year Undergraduate
MNNIT Allahabad
On Sun, Dec 23, 2012 at 11:14 PM, Prem Krishna Chettri
hprem...@gmail.comwrote:
Well I can tell you
Thanks for the link Ritesh,
if (isMatch(s, p+2)) return true;
isnt this line incorrect in the code, as it can lead to segmentation
fault... how can we directly access p+2 element, we know for sure that p is
not '\0', but p+1 element can be '\0' , therefore leading to p+2 to be
undefined.
On
I'm giving you a simple recursive code which i wrote long back. Please let
me know if it fails for any cases. Ignore the funny cout's It used to help
me debug and i'm lazy to remove it. :P :)
#includeiostream
#includestring
using namespace std;
/*
abasjc a*c
while(pattern[j] == '*' text[i] ==
@shady : either the string will be stored in heap or stack. thus accessing
address in heap or stack is not going to give u seg fault . and rest things
are very well handled in the code :)
As saurabh sir has explained in thread
https://mail.google.com/mail/u/1/#inbox/13ba918bdb9aac9e
when seg fault
@ritesh
umm, well here's a simple testcase to show the problem in the code..
isMatch(aa, a*)
On Thu, Dec 27, 2012 at 7:17 PM, Ritesh Mishra rforr...@gmail.com wrote:
@shady : either the string will be stored in heap or stack. thus accessing
address in heap or stack is not going to give u
If you need to implement this for some project then python and java have a
very nice library
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Sun, Dec 23, 2012 at 7:48 PM, shady sinv...@gmail.com wrote:
that's the point, Have to implement it from scratch... otherwise java has
regex and matcher, pattern to solve it...
On Sun, Dec 23, 2012 at 10:28 PM, saurabh singh saurab...@gmail.com wrote:
If you need to implement this for some project then python and java have a
very nice library
Well I can tell you Something about design pattern to solve this case..
What I mean is by using The State Machine Design Pattern, Anyone can
solve this. but Ofcourse it is complicated.
On Sun, Dec 23, 2012 at 11:01 PM, shady sinv...@gmail.com wrote:
that's the point, Have to
11 matches
Mail list logo
