On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
Given an array of integers nums, write a method that returns the “pivot” index of this array.
We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).
Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
Do you like me?
「LeetCode刷题（Easy Rank）：937. Reorder Log Files」
157 • 0 • 3月前
「LeetCode刷题（Easy Rank）：929. Unique Email Addresses」
45 • 0 • 3月前
「LeetCode刷题（Easy Rank）：859. Buddy Strings」
33 • 0 • 3月前
「LeetCode刷题（Easy Rank）：824. Goat Latin」
「LeetCode刷题（Easy Rank）：819. Most Common Word」
29 • 0 • 3月前