fffupeng的博客

string longestPalindrome(string s) {     int L = s.size();     int result = 0;     string s_res = s.substr(0,1);     int m, n;     if(L == 0 )     {         return "";     }     for (int i =

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. class Solution { public: vector res; void generate(string tmp,int L,int R) {

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all valid b

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly

Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. class Solution { publi

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 target. class Solution

原本一道非常简单的题，但是晚上没有状态，想了好久。。。 /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solu

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. /** * Definition for singly-linked list. * struct ListN

class Solution { public: vector> threeSum(vector& nums) { int L = nums.size(); set> res;//用于存放结果，set中不能含有相同的元素 sort(nums.begin(), nums.end()); //用stl sort排序 for (int i = 0; i < L - 2;

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find

#include "stdafx.h" #include #include #include using namespace std; string Longest_Common_Prefix(vector strs) { if (strs.empty()) return ""; int L = strs.size();//容器的长度 //寻找到最短的str的位置 int min_L

#include "stdafx.h" #include #include using namespace std; int RomanToInt(string s) { int res = 0;//初始化结果 int L = s.length(); string str[4]; //string s4, s3, s2, s1; int i = 0; //千位 while (s[i

#include "stdafx.h" #include #include using namespace std; int main(int argc, _TCHAR* argv[]) { int i; cin >> i; string Roman[4][10] = { "", "I", "II", "III","IV", "V", "VI", "VII", "VIII", "IX

class Solution { public:     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {     ListNode *p = l1,*p1 = 0,*r1;     while (p != 0&&l2!=0)     {         p->val = p->val + l2->val;       

#include "stdafx.h" #include #include using namespace std; int lengthOfLongestSubstring(string s) {     int pos[256];     memset(pos, -1, sizeof(pos));     int flag = -1, result = 0;//fl

// palindrome_number.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include using namespace std; //如果是回文，正反应该相同的大小 bool isPalindrome(int x) {     if (x         return 0;     int r = 0;   

Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 这是一道倒序输出整数的题目，给出的例也很简单。 // Reverse_Integer.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include #i

在一个二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。 class Solution { public: bool Find(int target, vector > array) { int height = array.size(); i