dby3579的专栏

因为复习的缘故，一开始按tag做起，难度也是从简单到困难237. Delete Node in a Linked List      这一题题目看了半天没看懂，实际上比较简单，就是给定一个List结点，从链表中删除他，代码如下：//My code /** * Definition for singly-linked list. * struct ListNode { *

还是链表章节的题目21.Merge Two Sorted Lists功能：将两个已排序的链表合并成一个//方法1：/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), n

257. Binary Tree Paths题意：给定一个二叉树，返回其从根到叶子节点的每一条路径/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x

还是链表的题目。。。143. Reorder List//My code //功能：将一个链表的倒数第一个结点插入到第一个结点后面，倒数第一个结点插入到第二个结点后面，以此类推。。。/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next;

本篇开始说明栈和队列的题目232. Implement Queue using Stacks//功能：使用栈结构执行队列结构的操作//注意：只能使用栈结构的标准操作：即push、pop、peek、size、empty。class Queue {public: stack in,out; // Push element x to the back of queue.

还是栈与队列的题目385. Mini ParserGiven a nested list of integers represented as a string, implement a parser to deserialize it.Each element is either an integer, or a list -- whose elements may also b

144. Binary Tree Preorder Traversal题意：实现二叉树的前序遍历//iterate 1/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * Tre

开始了leetcode的刷题之路，话不多说，从头开始，日积月累。344.Reverse String//my code#include using namespace std;class Solution {public: string reverseString(string s) { int numb = s.size(); strin