算法成长之路leetcode5-6

二分查找法模板的基本思想-leetcode35
算法成长之路leetcode1-4
leetcode-2-Add Two Numbers

leetcode-2-Add Two Numbers

Add Two Numbers

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 contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.


leetcode-1-Two Sum

leetcode-1-Two Sum

description

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 exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].



:D 一言句子获取中...