daiwen的博客

题目2： 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 ret

c++中string可以通过string.length()来获得string的长度，当对与一个数组来说就不是这么容易了。 如一个int型的数组： int a[] = {1,2,3,5,6,9};如何获得呢？ 可以通过sizeof的特殊用法，都知道sizeof()是获得所占的空间的大小，所以可以：int length = sizeof（a）/sizeof（int）;来得到a数组的元素个数。

Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le

实例1.1 最大子列和问题（20 分）给定K个整数组成的序列{ N1 , N​2​​ , …, N​K}，“连续子列”被定义为{ N​i​​ , N​i+1 , …, N​j​​ }，其1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 }，其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序，计算给

#include<iostream>#include<stdlib.h>using namespace std;struct ListNode{ int m_nValue; ListNode *m_pNext; ListNode(int n){ m_nValue = n; m_pNext = NULL; } };void DeleteNode(ListN...

#include<iostream>#include<stdlib.h>using namespace std;class Solution{public: char *strFind(char * string, char *substring) { if (string == NULL &&substring == NULL) ...