摘要:
Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文
摘要:
283. Move Zeroes Easy 220879FavoriteShare 283. Move Zeroes Easy 220879FavoriteShare Easy Given an array nums, write a function to move all 0's to the 阅读全文
摘要:
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra 阅读全文
摘要:
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra spa 阅读全文
摘要:
08/04/2019 Category: Array Problem #: 1. Two Sum: HashMap 15. 3Sum : Set one target and flow from left to right 16. 3Sum Closest : Pretty same as 3Sum 阅读全文
摘要:
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文
摘要:
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai 阅读全文
摘要:
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Example 1: Ex 阅读全文
摘要:
Count the number of prime numbers less than a non-negative number, n. Example: "这道题给定一个非负数n,让我们求小于n的质数的个数,题目中给了充足的提示,解题方法就在第二个提示埃拉托斯特尼筛法Sieve of Erato 阅读全文