u010128010的专栏

原创 下载正版软件

http://www.itellyou.cn/

原创 leetcode-120. Triangle

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [

原创 C++最大值和最小值表示

#define INT_MAX 0x7fffffff#define INT_MIN 0x80000000

原创 IP地址和子网掩码算子网地址

原创 leetcode-8. String to Integer (atoi)

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 ca

原创 leetcode-5. Longest Palindromic Substring

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.

原创 leetcode-3. Longest Substring Without Repeating Characters

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 "

原创 LeetCode-2. Add Two Numbers

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link

转载 删除2345网页导航

这个网址比较有用http://jingyan.baidu.com/article/48a42057bc42d3a9242504d2.html

原创 c#用法总结

1.string转int ：int id = int.Parse(str);2.int转string：string str = id.ToString();3.判断两字符串是否相等：str1.Equals(str2)或者String.Equals(str1,str2);4.读文件： string mpath = route + "ResultMutation\\

原创 九度oj_题目1511：从尾到头打印链表

题目1511：从尾到头打印链表时间限制：1 秒内存限制：128 兆特殊判题：否提交：6589解决：2003题目描述：输入一个链表，从尾到头打印链表每个节点的值。输入：每个输入文件仅包含一组测试样例。每一组测试案例包含多行，每行一个大于0的整数，代表一个链表的节点。第一行是链表第一个节点的值，依次

原创 九度oj_题目1510：替换空格

题目连接：http://ac.jobdu.com/problem.php?pid=1510超时原因：for(i = 0; str[i]; i ++)比for(i = 0; i #include #include #include int main(){ char str[1000000]; gets(str); char new_str[1000000];

原创 gets和scanf

字符串有空格用gets();字符串没空格用scanf();