2014年02月_xw_njust_ecjtu

10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创程序中堆和栈增长方向以及大小端问题

借鉴： http://midautumn.bokee.com/7005452.html http://www.cnblogs.com/xkfz007/archive/2012/06/22/2558935.html 对于栈的增长方向，由于c++中局部变量与函数参数的地址与编译器有一定依赖关系，在此通过函数调用函数，从而确保比较地址不依赖编译器。对于堆的话，直接分配在比较地址即可

2014-02-25 15:04:17 1203

原创 Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] ha

2014-02-18 13:07:08 654

原创 Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return [ ["aa","b"],

2014-02-17 21:02:03 594

原创 Letter Combinations of a Phone Number

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. Input:Digit st

2014-02-17 15:42:13 685

原创 Regular Expression Matching

Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input st

2014-02-14 16:11:51 785