[LintCode] Problem 508 - Wiggle Sort
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]….
ExampleInput: nums = [3,5,2,1,6,4]
Out
...
[LeetCode] Problem 732 - My Calendar III
Implement a MyCalendarThree class to store your events. A new event can always be added.
Your class will have one method, book(int start, int end). Fo
...
[LeetCode] Problem 731 - My Calendar II
Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking.
Your class will ha
...
[LeetCode] Problem 729 - My Calendar I
Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.
Your class will have
...
[LintCode] Problem 849 - Basic Calculator III
Implement a basic calculator to evaluate a simple expression string.
The expression string may contain open ( and closing parentheses ), the plus + or
...
[LeetCode] Problem 227 - Basic Calculator II
Implement a basic calculator to evaluate a simple expression string.
The expression string contains only non-negative integers, +, -, *, / operators a
...
[LeetCode] Problem 224 - Basic Calculator
Implement a basic calculator to evaluate a simple expression string.
The expression string may contain open ( and closing parentheses ), the plus + or
...
[LintCode] Problem 913 - Flip Game II
You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take tu
...
[LintCode] Problem 914 - Flip Game
You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take tu
...
[LeetCode] Problem 203 - Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.
ExampleInput: 1->2->6->3->4->5->6, val = 6
Output: 1->2-
...