LeetCode - Plus One
LeetCode 的 Plus One 題目如下: Given a non-negative number represented as an array of digits, plus one to the number. ...
LeetCode 的 Plus One 題目如下: Given a non-negative number represented as an array of digits, plus one to the number. ...
LeetCode 的 Valid Parentheses 題目如下: Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. ...
LeetCode 的 Contains Duplicate III 題目如下: Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is at most k. ...
LeetCode 的 Contains Duplicate II 題目如下: Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k. ...
LeetCode 的 Contains Duplicate 題目如下: Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct. ...