大约有 37,000 项符合查询结果（耗时：0.0165秒） [XML]
How to write log to file
I'm trying to write to a log file with Go.
11 Answers
11
...
Can grep show only words that match search pattern?
Is there a way to make grep output "words" from files that match the search expression?
14 Answers
...
If strings are immutable in .NET, then why does Substring take O(n) time?
Given that strings are immutable in .NET, I'm wondering why they have been designed such that string.Substring() takes O( substring.Length ) time, instead of O(1) ?
...
Reverse of JSON.stringify?
I'm stringyfing an object like {'foo': 'bar'}
8 Answers
8
...
Hashset vs Treeset
I've always loved trees, that nice O(n*log(n)) and the tidiness of them. However, every software engineer I've ever known has asked me pointedly why I would use a TreeSet . From a CS background, I don't think it matters all that much which you use, and I don't care to mess around with hash functi...
The $.param( ) inverse function in JavaScript / jQuery
Given the following form:
18 Answers
18
...
Find the Smallest Integer Not in a List
An interesting interview question that a colleague of mine uses:
28 Answers
28
...
Ukkonen's suffix tree algorithm in plain English
I feel a bit thick at this point. I've spent days trying to fully wrap my head around suffix tree construction, but because I don't have a mathematical background, many of the explanations elude me as they start to make excessive use of mathematical symbology. The closest to a good explanation that ...
Why is quicksort better than mergesort?
I was asked this question during an interview. They're both O(nlogn) and yet most people use Quicksort instead of Mergesort. Why is that?
...
Count number of occurrences of a pattern in a file (even on same line)
When searching for number of occurrences of a string in a file, I generally use:
5 Answers
...