- 博客(13)
- 收藏
- 关注
RSS订阅原创 Reverse Integer
Reverse Integer题目Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321 Have you thought about this? Here are some good questions to ask before coding. Bonus poin
2015-08-30 10:01:47
232
原创 006ZigZag Conversion
ZigZag Conversion题目The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H
2015-08-30 09:02:52
262
原创 005Longest Palindromic Substring
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, and there exists one unique longest palindromic substr
2015-08-29 18:38:25
271
原创 004Median of Two Sorted Arrays
题目There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).代码double findK(int* nums1,
2015-08-28 08:36:10
338
原创 3 Longest Substring Without Repeating Characters
3 Longest Substring Without Repeating Characters题目Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo
2015-08-26 10:39:08
311
原创 002Add Two Numbers
002Add Two Numbers目录002Add Two Numbers目录题目内容我的代码小记第二题比较简单，应该是最优的，只要处理好链表和地址即可，需要学习下函数中malloc和new关于内存的区别。malloc与new题目内容==You are given two linked lists representing two non-negative numbers. The d
2015-08-25 13:52:40
320
原创 001TwoSum
001TwoSum目录001TwoSum目录题目内容我的代码小记做什么事情都不完，现在要大四了，重新拾起算法数据结构，从leetcode开始。vector用法map用法题目内容==Given an array of integers, find two numbers such that they add up to a specific target number.The funct
2015-08-25 11:50:48
254
转载 进程隐藏与进程保护（SSDT Hook 实现）（一）
文章目录： 1. 引子 – Hook 技术：2. SSDT 简介：3. 应用层调用 Win32 API 的完整执行流程：4. 详解 SSDT：5. SSDT Hook 原理：6. 小结： 1. 引子 – Hook 技术： 前面一篇博文呢介绍了代码的注入
2013-12-28 22:06:27
560
1
原创 排序模板 (待续)
First . 冒泡排序 复杂度 O（n^2）# include void bubbleSort(int arr[],int n) { int i,j,t; for(i=0;i<n-1;i++) { for(j=0;j<n-i-1;j++) { i
2013-08-20 16:44:58
484
转载 POJ 2342 Anniversary party
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3235 Accepted: 1796DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. T
2013-07-11 10:16:06
324
转载 hdu 4003 Find Metal Mineral
#include#include#include#include#define N 100010using namespace std;int n,root,soldiers;typedef struct MyStruct{int child;int val;}NODE;vectorf[N];//f[N]存父亲节点的子节点int dp[N][12];//dp[i][j]定义状态i节点的子树上分配j
2013-07-11 10:11:43
451
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人