You need to capture the state in some accumulators and update the state at each iteration. If you have experience in an imperative language, imagine writing a while loop and tracking information in variables during each iteration of the loop. What variables would you need? How would you update them? That’s exactly what you have … Read more
As @Didier said, you can change your delimiter to something other than /: grep -rl $oldstring /path/to/folder | xargs sed -i s@$oldstring@$newstring@g
Both your code and nub have O(N^2) complexity. You can improve the complexity to O(N log N) and avoid using elem by sorting, grouping, and taking only the first element of each group. Conceptually, rmdups :: (Ord a) => [a] -> [a] rmdups = map head . group . sort Suppose you start with the … Read more
Accessing a new type causes the runtime to recompile it from IL to native code (x86 etc). The runtime also optimizes the code, which will also produce different results for value types and reference types. And List<int> clearly will be optimized differently than List<List<int>>. Thus also EmptyStack<int> and NonEmptyStack<int, EmptyStack<int>> and so on will be … Read more
Your definition is perfectly fine. It’s a known issue with rendering recursive schemas in Swagger Editor and Swagger UI: https://github.com/swagger-api/swagger-ui/issues/3325 To work around the “Example Value” showing null/”string”/undefined instead of a recursive element, you can add a custom example to your schema: definitions: TreeNode: type: object properties: name: type: string description: The name of the … Read more
On Windows (at least), sys.setrecursionlimit isn’t the full story. The hard limit is on a per-thread basis and you need to call threading.stack_size and create a new thread once you reach a certain limit. (I think 1MB, but not sure) I’ve used this approach to increase it to a 64MB stack. import sys import threading … Read more
It’s exactly the same principle as for x^n == x*(x^(n-1)): Insert your recursive function for x^(n/2) and (…)^2, but make sure you don’t enter an infinite recursion for n == 2 (as 2 is even, too): if (n % 2 == 0 && n > 2) return power(power(x, n / 2), 2); } Alternatively, you … Read more
I agree with the logic of your method but there is no need to do recursive processing or global maxima searches. To find the sell/buy days you just need to look at each day once: The trick is to start from the end. Stock trade is easy if your travel backwards in time! If you … Read more
For the most part recursion is slower, and takes up more of the stack as well. The main advantage of recursion is that for problems like tree traversal it make the algorithm a little easier or more “elegant”. Check out some of the comparisons: link
This will exit after the first element that is out of order. It should thus perform well, but I haven’t tested that. It’s also a lot more elegant in my opinion. 🙂 def sorted(l:List[Int]) = l.view.zip(l.tail).forall(x => x._1 <= x._2)