Name		Name	Last commit message	Last commit date
parent directory ..
1353MaximumNumberofEventsThatCanBeAttended		1353MaximumNumberofEventsThatCanBeAttended
146-lru-cache		146-lru-cache
200-number-of-islands		200-number-of-islands
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
295-find-median-from-data-stream		295-find-median-from-data-stream
4-MedianOfTwoSortedArrays		4-MedianOfTwoSortedArrays
480-sliding-window-median		480-sliding-window-median
LRUCache.cpu.png		LRUCache.cpu.png
LRUCache.mem.png		LRUCache.mem.png
Readme.md		Readme.md
RemoveDuplicatesFromSortedArray.cpu.png		RemoveDuplicatesFromSortedArray.cpu.png
RemoveDuplicatesFromSortedArray.mem.png		RemoveDuplicatesFromSortedArray.mem.png
SlidingWindowMedian.cpu.png		SlidingWindowMedian.cpu.png
SlidingWindowMedian.mem.png		SlidingWindowMedian.mem.png
lowest-common-ancestor-of-a-binary-tree.cpu.png		lowest-common-ancestor-of-a-binary-tree.cpu.png
lowest-common-ancestor-of-a-binary-tree.mem.png		lowest-common-ancestor-of-a-binary-tree.mem.png

Readme.md

Submissions

https://leetcode.com/xunilrj/

Algorithms

Remove Duplicates from Sorted Array

Runtime: 20 ms
Memory Usage: 7.6 MB
https://leetcode.com/submissions/detail/321115997/

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        auto size = nums.size();
        auto copyTo = 0;
        
        for(int i = 0;i < size;)
        {
            nums[copyTo] = nums[i];
            auto& current = nums[i];
     
            do
            {
                ++i;
            }
            while((i < size) && (current == nums[i]));
            
            ++copyTo;
        }
        
        return copyTo;
    }
};

235. Lowest Common Ancestor of a Binary Search Tree

Runtime: 32 ms Your runtime beats 96.18 % of cpp submissions.
Memory Usage: 23.4 MB Your runtime beats 100 % of cpp submissions.

https://leetcode.com/submissions/detail/327569400/

Lowest Common Ancestor of a Binary Tree

Runtime: 16 ms (Your runtime beats 95.94 % of cpp submissions.)
Memory Usage: 14.7 MB (Your runtime beats 100 % of cpp submissions.)

https://leetcode.com/submissions/detail/327338526/

Median of Two Sorted Arrays

Rust see code

Runtime: 4 ms, faster than 70.71% of Rust online submissions for Median of Two Sorted Arrays.
Memory Usage: 2.2 MB, less than 28.57% of Rust online submissions for Median of Two Sorted Arrays.

https://leetcode.com/submissions/detail/433660231