garrulousabyss的博客

【代码】1. 两数之和。

题目描述 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 re...

leetcode之DP总结 2017年07月29日 22:51:39 svdalv 阅读数：357 版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/ns708865818/article/details/76266896 303. Range Sum Query - Immutable 解题思路：给定一个数组，计算给定区间的数字的和。利用D...

这篇文章的主题是动态规划， 主要介绍LeetCode中一维动态规划的题目， 列表如下：  Climbing Stairs Decode Ways Unique Binary Search Trees Maximum Subarray Maximum Product Subarray Best Time to Buy and Sell Stock 在介绍上述具体题目之前, 我们先说说动态...

//Method 1: Two-pass approach /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class...

//题目链接：https://leetcode.com/problems/two-sum/ class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { for(size_t i{0}; i < nums.size(); i++){ ...

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* a...

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* m...