摘要：
题目： Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2. Given three strings: s1, s2, s3, determine wheth 阅读全文
posted @ 2017-05-21 09:50
Vincent丶丶
阅读(166)
评论(0)
推荐(0)
摘要：
题目： Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed fr 阅读全文
posted @ 2017-05-20 22:11
Vincent丶丶
阅读(244)
评论(0)
推荐(0)
摘要：
题目： Given two strings, find the longest common subsequence (LCS). Your code should return the length of LCS. Given two strings, find the longest commo 阅读全文
posted @ 2017-05-20 21:37
Vincent丶丶
阅读(165)
评论(0)
推荐(0)
摘要：
题目： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You h 阅读全文
posted @ 2017-05-20 21:09
Vincent丶丶
阅读(216)
评论(0)
推荐(0)
摘要：
题目： Given a sequence of integers, find the longest increasing subsequence (LIS). You code should return the length of the LIS. Given a sequence of int 阅读全文
posted @ 2017-05-20 20:40
Vincent丶丶
阅读(143)
评论(0)
推荐(0)
摘要：
函数签名的概念 函数签名主要包括1、函数名；2、参数列表（参数的个数、数据类型和顺序）；但是注意，C++官方定义中函数签名不包括返回值！！ 1、重载 函数重载是指在同一作用域内，可以有一组具有相同函数名，不同参数列表的函数，这组函数被称为重载函数，与函数返回类型无关。重载要求参数列表必须不同，比如参 阅读全文
posted @ 2017-05-20 11:11
Vincent丶丶
阅读(197)
评论(0)
推荐(0)
摘要：
题目： Count the number of k's between 0 and n. k can be 0 - 9. Count the number of k's between 0 and n. k can be 0 - 9. Count the number of k's between 阅读全文
posted @ 2017-05-19 22:34
Vincent丶丶
阅读(149)
评论(0)
推荐(0)
摘要：
此贴为汇总贴 673. Number of Longest Increasing Subsequence 075. Sort Colors 009. Palindrome Number 008. String to Integer (atoi) 007. Reverse Integer 006. Z 阅读全文
posted @ 2017-05-19 21:08
Vincent丶丶
阅读(161)
评论(0)
推荐(0)
摘要：
摘要： 1. 面向对象程序设计的核心思想是数据抽象、继承和动态绑定。数据抽象将类的接口和实现分离；继承定义相似的类型并对齐相似关系建模；动态绑定，在一定程度上忽略相似类型的区别，而以统一的方式使用它们的对象。 2. 派生类列表中每个基类前面可以有访问说明符；派生类必须在其内部对所有重新定义的虚函数进 阅读全文
posted @ 2017-05-19 20:37
Vincent丶丶
阅读(250)
评论(0)
推荐(0)
摘要：
题目： Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Example Given 阅读全文
posted @ 2017-05-18 21:13
Vincent丶丶
阅读(346)
评论(0)
推荐(0)
浙公网安备 33010602011771号