wyj7260的专栏

class Solution {public: vector getRow(int rowIndex) { vector result; int i = 0; int j = 0; if(rowIndex < 0) { return result; } result.

struct Node{ int index; int value;};bool compare(Node a, Node b){ return a.value < b.value;}class Solution {public: vector twoSum(vector &numbers, int target) {

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ /** * http

/*** 题目：https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/* Say you have an array for which the ith element is the price of a given stock on day i.* Design an algorithm to find t

/** * Say you have an array for which the ith element is the price of a given stock on day i. * Design an algorithm to find the maximum profit. You may complete as many transactions as you like *

class Solution {public: int removeDuplicates(int A[], int n) { int duplicate = 0; int i = 0; for(i = 0; i < n - 1; i++){ if(A[i] == A[i + 1]){ dupli

/** * https://oj.leetcode.com/problems/surrounded-regions/ * 从四个边界的'O'出发，它们所能到达的'O'就是没有被包围的'O'。 * 所以，该题可以用BFS遍历或者DFS遍历。*/class Solution {public: void solve(vector> &board) { int row

/**Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u

class Solution {public: vector > generate(int numRows) { vector > result; vector innerResult; int i = 0; int j = 0; for(i = 0; i < numRows; i++){

//Given a non-negative number represented as an array of digits, plus one to the number.//The digits are stored such that the most significant digit is at the head of the list.//digits={9,9,9,

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

https://oj.leetcode.com/problems/candy/

/*** https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/* Say you have an array for which the ith element is the price of a given stock on day i.* If you were only permitted to comple

非递归解法/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class

/** *https://oj.leetcode.com/problems/longest-common-prefix * Write a function to find the longest common prefix string amongst an array of strings. * 问题描述：写一个函数找到一组字符串的最长公共前缀。 * 这个题要明确一个观点，一组

/*#include using namespace std; *//** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */cla

/*意思就是：给定一个三角形，求得和最小的路径。每层只能选一个整数，上一层和下一层的整数必须是相邻的。思路：1,动态规划。到第i层的第k个顶点的最小路径长度表示为f(i,k)，则f(i, k) = min{f(i-1,k), f(i-1,k-1)} + d(i, k); 其中d(i, k)表示原来三角形数组里 的第i行第k列的元素。则可以求得从第一行到最终到第length-1行第