not_solved
文章平均质量分 63
baladeer
CV菜鸟
展开
-
560. Subarray Sum Equals K
560. Subarray Sum Equals K Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums = [1,1,1], k原创 2018-01-11 08:35:09 · 139 阅读 · 0 评论 -
523. Continuous Subarray Sum
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up t原创 2018-01-11 09:40:40 · 125 阅读 · 0 评论 -
371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. 00 + 00->00 00 + 01-> 01 01 + 00-> 01 01 + 01-> 10 cl原创 2018-01-12 03:38:27 · 93 阅读 · 0 评论 -
179. Largest Number
Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The result may be ve原创 2018-01-12 23:09:04 · 549 阅读 · 0 评论 -
479. Largest Palindrome Product
Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest palindrome mod 1337. Example: Input: 2 Output:原创 2018-01-13 04:46:20 · 120 阅读 · 0 评论 -
50. Pow(x, n)
Implement pow(x, n). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: Input: 2.10000, 3 Output: 9.26100 class Solution { public: double myPow(double x, int n) {原创 2018-01-14 02:13:59 · 105 阅读 · 0 评论 -
445. Add Two Numbers II
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return i原创 2018-01-08 11:45:15 · 104 阅读 · 0 评论 -
43. Multiply Strings
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: The length of both num1 and num2 is Both num1 and num2 contains only digits原创 2018-01-08 13:01:47 · 91 阅读 · 0 评论 -
109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which th原创 2018-01-09 22:33:58 · 93 阅读 · 0 评论