摘要:
Running Sum of 1d Array Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nu 阅读全文
摘要:
Path Crossing Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. 阅读全文
摘要:
Count Odd Numbers in an Interval Range Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive). 阅读全文
摘要:
Make The String Great Given a string s of lower and upper case English letters. A good string is a string which doesn't have two adjacent characters s 阅读全文
摘要:
Squares of a Sorted Array Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decr 阅读全文
摘要:
Remove Outermost Parentheses A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and 阅读全文
摘要:
Relative Sort Array Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Sort the elements of 阅读全文
摘要:
Greatest Common Divisor of Strings For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself o 阅读全文
摘要:
Create Target Array in the Given Order Given two arrays of integers nums and index. Your task is to create target array under the following rules: Ini 阅读全文
摘要:
Find Lucky Integer in An Array Given an array of integers arr, a lucky integer is an integer that has a frequency in the array equal to its value. Ret 阅读全文