题解
猴塞雷咩
本科,软工,大三
展开
-
183. Customers Who Never Order (LeetCode, SQL)
183. Customers Who Never Order Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything. Table: Cust原创 2016-11-10 16:36:06 · 272 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List(LeetCode)
Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3./** * Definition for原创 2016-11-10 17:06:25 · 301 阅读 · 0 评论 -
343. Integer Break(LeetCode, C++, 动态规划)
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return 1原创 2016-11-09 18:17:51 · 450 阅读 · 0 评论 -
Bigint Multiplication:大数乘法(hihoCoder C++)
Bigint Multiplication时间限制:10000ms 单点时限:1000ms 内存限制:256MB描述Given 2 nonnegative integers a and b, calculate a × b.输入One line with 2 integers a and b separated by a single space.0 ≤ a, b ≤ 10100.输出The v原创 2016-11-09 17:19:21 · 721 阅读 · 0 评论 -
442. Find All Duplicates in an Array(LeetCode)
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it without extra space原创 2016-11-10 23:42:00 · 294 阅读 · 0 评论 -
372. Super Pow(LeetCode)
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example1: a = 2 b = [3] Result: 8Example2: a原创 2016-11-10 17:30:32 · 275 阅读 · 0 评论