Back to Problem

All categories
OJ (151)
- Two Sum (1)
- Add Two Numbers (2)
- Longest Substring Without Repeating Characters (0)
- Median of Two Sorted Arrays (1)
- Longest Palindromic Substring (1)
- ZigZag Conversion (0)
- Reverse Integer (1)
- String to Integer (atoi) (0)
- Palindrome Number (1)
- Regular Expression Matching (1)
- Container With Most Water (0)
- Integer to Roman (1)
- Roman to Integer (0)
- Longest Common Prefix (0)
- 3Sum (4)
- 3Sum Closest (0)
- Letter Combinations of a Phone Number (0)
- 4Sum (0)
- Remove Nth Node From End of List (0)
- Valid Parentheses (1)
- Merge Two Sorted Lists (1)
- Generate Parentheses (0)
- Merge k Sorted Lists (1)
- Swap Nodes in Pairs (0)
- Reverse Nodes in k-Group (0)
- Remove Duplicates from Sorted Array (2)
- Remove Element (0)
- Implement strStr() (0)
- Divide Two Integers (0)
- Substring with Concatenation of All Words (1)
- Next Permutation (0)
- Longest Valid Parentheses (0)
- Search in Rotated Sorted Array (0)
- Search for a Range (1)
- Search Insert Position (0)
- Valid Sudoku (1)
- Sudoku Solver (0)
- Count and Say (1)
- Combination Sum (1)
- Combination Sum II (0)
- First Missing Positive (1)
- Trapping Rain Water (0)
- Multiply Strings (2)
- Wildcard Matching (2)
- Jump Game II (1)
- Permutations (0)
- Permutations II (0)
- Rotate Image (0)
- Anagrams (3)
- Pow(x, n) (1)
- N-Queens (0)
- N-Queens II (1)
- Maximum Subarray (1)
- Spiral Matrix (0)
- Jump Game (1)
- Merge Intervals (2)
- Insert Interval (0)
- Length of Last Word (0)
- Spiral Matrix II (0)
- Permutation Sequence (0)
- Rotate List (0)
- Unique Paths (1)
- Unique Paths II (0)
- Minimum Path Sum (1)
- Valid Number (0)
- Plus One (0)
- Add Binary (0)
- Text Justification (0)
- Sqrt(x) (2)
- Climbing Stairs (0)
- Simplify Path (0)
- Edit Distance (0)
- Set Matrix Zeroes (0)
- Search a 2D Matrix (1)
- Sort Colors (1)
- Minimum Window Substring (0)
- Combinations (0)
- Subsets (0)
- Word Search (1)
- Remove Duplicates from Sorted Array II (0)
- Search in Rotated Sorted Array II (1)
- Remove Duplicates from Sorted List II (0)
- Remove Duplicates from Sorted List (1)
- Largest Rectangle in Histogram (0)
- Maximal Rectangle (1)
- Partition List (1)
- Scramble String (0)
- Merge Sorted Array (0)
- Gray Code (1)
- Subsets II (1)
- Decode Ways (1)
- Reverse Linked List II (1)
- Restore IP Addresses (1)
- Binary Tree Inorder Traversal (0)
- Unique Binary Search Trees II (1)
- Unique Binary Search Trees (2)
- Interleaving String (0)
- Validate Binary Search Tree (1)
- Recover Binary Search Tree (0)
- Same Tree (0)
- Symmetric Tree (2)
- Binary Tree Level Order Traversal (0)
- Binary Tree Zigzag Level Order Traversal (0)
- Maximum Depth of Binary Tree (0)
- Construct Binary Tree from Preorder and Inorder Traversal (0)
- Construct Binary Tree from Inorder and Postorder Traversal (0)
- Binary Tree Level Order Traversal II (0)
- Convert Sorted Array to Binary Search Tree (0)
- Convert Sorted List to Binary Search Tree (1)
- Balanced Binary Tree (3)
- Minimum Depth of Binary Tree (1)
- Path Sum (1)
- Path Sum II (0)
- Flatten Binary Tree to Linked List (3)
- Distinct Subsequences (1)
- Populating Next Right Pointers in Each Node (0)
- Populating Next Right Pointers in Each Node II (0)
- Pascal's Triangle (1)
- Pascal's Triangle II (0)
- Triangle (1)
- Best Time to Buy and Sell Stock (0)
- Best Time to Buy and Sell Stock II (3)
- Best Time to Buy and Sell Stock III (0)
- Binary Tree Maximum Path Sum (1)
- Valid Palindrome (0)
- Word Ladder II (2)
- Word Ladder (6)
- Longest Consecutive Sequence (1)
- Sum Root to Leaf Numbers (2)
- Surrounded Regions (1)
- Palindrome Partitioning (0)
- Palindrome Partitioning II (1)
- Clone Graph (1)
- Gas Station (0)
- Candy (4)
- Single Number (1)
- Single Number II (2)
- Copy List with Random Pointer (5)
- Word Break (2)
- Word Break II (3)
- Linked List Cycle (2)
- Linked List Cycle II (3)
- Reorder List (7)
- Binary Tree Preorder Traversal (2)
- Binary Tree Postorder Traversal (3)
- LRU Cache (11)
- Insertion Sort List (2)
- Sort List (7)
- Max Points on a Line (7)
- Evaluate Reverse Polish Notation (0)

Recursive vs. Iterative

237 views

I just used two ways to solve this problem, recursive and iterative solution. And both of the two solutions pass the OJ and they cost almost the same time, even the recursive one better.

So it is not strict with the memory limit, right?

asked Nov 18 in Sort List by Decheng (260 points)

The judge is purposely set to allow a variety of solutions to get accepted. This is so that a reader could explore multiple solutions and experiment with them. If you want the ultimate challenge, try coding a quick sort which is able to pass the judge.

commented Nov 18 by 1337c0d3r (5,580 points)

1 Answer

I think sandbox may not be easy to judge on stack usage.. By recursive if you use system stack, it should be fine. (I'm just guessing as I'm not 1337 himself)

answered Nov 19 by elfenlieds7 (140 points)

No, the judge is able to limit the stack space if I wanted to. For example, if you use the recursive DFS approach for the problem Surrounded Regions, it will result in a Runtime Error.

I relaxed the stack space requirement for this problem so a user is able to experiment with a variety of algorithmic techniques.

commented 6 days ago by 1337c0d3r (5,580 points)

Don't know exactly which sandbox do you use, but in general it's not easy. I understand there're variety of ways of doing so, but none of them should throw "runtime error". "runtime error" may give me a hint that the sandbox tries to set the intial stack size as config and doesn't handle stack overflow exception which result in a AV. Is this the approach? :) And my previous answer to that gentleman is tentatively to answer his "memory limit" confuse, which is not seemed resolved in current sandbox as talked above.

commented 5 days ago by elfenlieds7 (140 points)

...