Eswai的专栏

445. Add Two Numbers IIProblem descriptionYou are given two linked lists representing two non-negative numbers. The most significant digit comes first and each of their nodes contain a single digit. Ad

LeetCode: 26. Remove Duplicates from Sorted Array 删除有序数组中的重复元素问题描述Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate

Leetcode: 441. Arranging Coins排列硬币问题描述You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the total number of full stair

Leetcode: 15. 3Sum 三数之和问题描述Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set m

Leetcode: 18. 4Sum 四数之和问题描述Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of targe

Leetcode: 309. Best Time to Buy and Sell Stock with Cooldown 有冷却机制的炒股问题-作者: Eswai (eswai@foxmail.com) 利用有限状态自动机解决。

Leetcode: 49. Group Anagrams 对颠倒字符串分组作者: Eswai (eswai@foxmail.com) 优快云: blog.youkuaiyun.com/eswai问题描述Given an array of strings, group anagrams together.Example:, Given: [“eat”, “tea”, “tan”, “ate”, “na

问题描述 平方串： 形如string s = T + T的字符串 目标： 对于字符串s，除去若干字符使其成为平方串，求该平方串的最大长度。 思路与实现将s分成两半，求两个子串的最大子序列长度（longest common subsequence）的最大值ans，最长平方串长度就是2*ans。const int MAXN = 50; int c[MAXN][MAXN] = { 0 }; // s