LintCode
风顺水流
never stop!
展开
-
LintCode-剑指Offer-(71)二叉树的锯齿形层次遍历
class Solution { /** * @param root: The root of binary tree. * @return: A list of lists of integer include * the zigzag level order traversal of its nodes' values */public原创 2015-12-05 13:40:10 · 482 阅读 · 0 评论 -
LintCode-剑指Offer-(50)数组剔除元素后的乘积
class Solution {public: /** * @param A: Given an integers array A * @return: A long long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1] */ vector<long long> productE原创 2015-12-05 13:04:50 · 257 阅读 · 0 评论 -
LintCode-剑指Offer-(8)旋转字符
class Solution {public: /** * @param str: a string * @param offset: an integer * @return: nothing */ void rotateString(string &str,int offset){ //wirte your code here原创 2015-12-05 09:56:56 · 234 阅读 · 0 评论 -
LintCode-剑指Offer-(5)第k大元素
class Solution {public: /* * param k : description of k * param nums : description of array and index 0 ~ n-1 * return: description of return */ int kthLargestElement(int k,vec原创 2015-12-04 08:40:25 · 440 阅读 · 0 评论 -
LintCode-剑指Offer-(381)数倒置
vector<vector<int>> generateMatrix(const int n) { // Write your code here bool **IsVisited; IsVisited = new bool*[n]; vector<vector<int>> v; if (n==0)return v;原创 2015-12-04 08:33:47 · 638 阅读 · 0 评论 -
LintCode-剑指Offer-(380)两个链表的交叉
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: /** * @pa原创 2015-11-29 17:01:53 · 567 阅读 · 0 评论 -
LintCode-剑指Offer-(41)最大子数组
class Solution {public: /** * @param nums: A list of integers * @return: A integer indicate the sum of max subarray */ int maxSubArray(vector<int> nums) { // write your cod原创 2015-11-29 16:47:48 · 340 阅读 · 0 评论 -
LintCode-剑指Offer-(374)螺旋矩阵
class Solution {public: /** * @param matrix a matrix of m x n elements * @return an integer array */ vector<int> spiralOrder(vector<vector<int>>& matrix) { // Write your co原创 2015-11-29 13:22:59 · 937 阅读 · 0 评论 -
LintCode-剑指Offer-(46)主元素
class Solution {public: /** * @param nums: A list of integers * @return: The majority number */ int majorityNumber(vector<int> nums) { // write your code here int n原创 2015-11-29 14:24:03 · 373 阅读 · 0 评论 -
LintCode-剑指Offer-(378)将二叉查找树转换成双链表
class Solution {public: /** * @param root: The root of tree * @return: the head of doubly list node */ DoublyListNode* bstToDoublyList(TreeNode* root) { // Write your code原创 2015-11-29 14:18:00 · 2178 阅读 · 0 评论 -
LintCode-剑指Offer-(208)赋值运算符重载
class Solution {public:char *m_pData; Solution() { this->m_pData = NULL; } Solution(char *pData) { this->m_pData = pData; }// Implement an assignment operator Solutio原创 2015-11-21 01:43:39 · 341 阅读 · 0 评论 -
LintCode-剑指Offer-(97)二叉树的最大深度
/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right =原创 2015-12-05 09:31:48 · 265 阅读 · 0 评论 -
LintCode-剑指Offer-(1)A+B问题
class Solution {public: /* * @param a: The first integer * @param b: The second integer * @return: The sum of a and b */ int aplusb(int a, int b) { // write your co原创 2015-12-05 09:59:08 · 286 阅读 · 0 评论 -
LintCode-剑指Offer-(54)转换字符串到整数
class Solution {public: /** * @param str: A string * @return An integer */ int atoi(string str) { // write your code here int sum=0; int i = str.length()-1;原创 2015-12-05 12:51:06 · 235 阅读 · 0 评论 -
LintCode-剑指Offer-(56)两数之和
class Solution {public: /* * @param numbers : An array of Integer * @param target : target = numbers[index1] + numbers[index2] * @return : [index1+1, index2+1] (index1 < index2) */原创 2015-12-05 10:09:08 · 284 阅读 · 0 评论 -
LintCode-剑指Offer-(53)翻转字符串
void split(std::string& s,std::string& delim,std::vector< std::string >* ret){ size_t last = 0; size_t index = s.find_first_of(delim,last); while (index!=std::string::npos) { r原创 2015-12-05 09:49:13 · 400 阅读 · 0 评论 -
LintCode-剑指Offer-(82)落单的数
class Solution {public: /** * @param A: Array of integers. * return: The single number. */ int singleNumber(vector<int> &A) { // write your code here int n=0;原创 2015-12-05 09:34:15 · 300 阅读 · 0 评论 -
LintCode-剑指Offer-(88)最近公共祖先
class Solution {public: /** * @param root: The root of the binary search tree. * @param A and B: two nodes in a Binary. * @return: Return the least common ancestor(LCA) of the two node原创 2015-12-05 12:30:59 · 361 阅读 · 0 评论 -
LintCode-剑指Offer-(61)搜索区间
class Solution { /** *@param A : an integer sorted array *@param target : an integer to be inserted *return : a list of length 2, [index1, index2] */public: vector<int> search原创 2015-12-05 10:05:37 · 315 阅读 · 0 评论 -
LintCode-剑指Offer-(3)统计数字
class Solution {public: /* * param k : As description. * param n : As description. * return: How many k's between 0 and n. */ int countint(int k,int n){ int num = 0;原创 2015-12-05 09:23:40 · 612 阅读 · 0 评论 -
LintCode-剑指Offer-(4)丑数
class Solution {public: /* * @param k: The number k. * @return: The kth prime number as description. */ long long Min(long long i,long long j,long long k){ return min(i原创 2015-12-04 10:37:56 · 351 阅读 · 0 评论 -
LintCode-剑指Offer-(83)落单的数 II
**class Solution {public: /** * @param A : An integer array * @return : An integer */ int singleNumberII(vector &A) { // write your code here map原创 2015-12-05 14:25:16 · 458 阅读 · 0 评论 -
LintCode-剑指Offer-(112)删除排序链表中的重复元素
class Solution {public: /** * @param head: The first node of linked list. * @return: head node */ ListNode *deleteDuplicates(ListNode *head) { // write your code here原创 2015-12-05 12:56:30 · 351 阅读 · 0 评论 -
LintCode-剑指Offer-(40)用栈实现队列
class Queue {public:stack<int> stack1; stack<int> stack2; Queue() { // do intialization if necessary } void push(int element) { // write your code here while(stack1.empt原创 2015-11-20 23:29:38 · 260 阅读 · 0 评论 -
LintCode-剑指Offer-(376)二叉树路径求和
/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right =原创 2015-11-29 12:27:48 · 424 阅读 · 0 评论 -
LintCode-剑指Offer-(365)二进制中有多少个1
class Solution {public: /** * @param num: an integer * @return: an integer, the number of ones in num */ int countOnes(int num) { // write your code here原创 2015-11-16 23:45:16 · 820 阅读 · 0 评论 -
LintCode-剑指Offer-(105)复制带随机指针的链表
class Solution {public: /** * @param head: The head of linked list with a random pointer. * @return: A new head of a deep copy of the list. */ //递归真是个好东西,没想到真能用一个变量实现,简洁明了啊,非常好。原创 2015-11-22 02:25:50 · 1545 阅读 · 0 评论 -
LintCode-剑指Offer-(12)带最小值操作的栈
class MinStack {public: MinStack() { // do initialization if necessary } stack<int> s; stack<int> minstack; int minnum; void push(int number) { // write your co原创 2015-11-22 01:22:11 · 271 阅读 · 0 评论 -
LintCode-剑指Offer-(70)二叉树的层次遍历Ⅱ
class Solution { /** * @param root: The root of binary tree. * @return: Level order a list of lists of integer */ public: void lev(TreeNode* node, int levelnum, vector原创 2015-11-22 01:03:42 · 362 阅读 · 0 评论 -
LintCode-剑指Offer-(140)快速幂
class Solution {public: /* * @param a, b, n: 32bit integers * @return: An integer */ //要用long long类型,不然可能溢出 long long fastPower(long long a, long long b, long long n) {原创 2015-11-22 00:00:07 · 463 阅读 · 0 评论 -
LintCode-剑指Offer-(373)奇偶分割数组
class Solution {public: /** * @param nums: a vector of integers * @return: nothing */ void partitionArray(vector<int> &nums) { // write your code here int i=0;原创 2015-11-21 17:32:17 · 873 阅读 · 0 评论 -
LintCode-剑指Offer-(73)前序遍历和中序遍历树构造二叉树
class Solution { /**' * ' *@param preorder : A list of integers that preorder traversal of a tree *@param inorder : A list of integers that inorder traversal of a tree *@return : Ro原创 2015-11-21 17:05:29 · 310 阅读 · 0 评论 -
LintCode-剑指Offer-(160)寻找旋转排序数组中的最小值Ⅱ
class Solution {public: /** * @param num: the rotated sorted array * @return: the minimum number in the array */ int findMin(vector<int> &num) { // write your code here原创 2015-11-21 01:51:58 · 274 阅读 · 0 评论 -
LintCode-剑指Offer-(28)寻找旋转排序数组中的最小值
class Solution {public:/*** @param matrix, a list of lists of integers* @param target, an integer* @return a boolean, indicate whether matrix contains target*/bool searchMatrix(vector<vector<int原创 2015-11-21 01:24:18 · 306 阅读 · 0 评论 -
LintCode-剑指Offer-(372)在O(1)时间复杂度删除链表节点
/** * Definition of ListNode * class ListNode { * public: * int val; * ListNode *next; * ListNode(int val) { * this->val = val; * this->next = NULL; * } * } *原创 2015-11-21 17:44:14 · 306 阅读 · 0 评论 -
LintCode-剑指Offer-斐波拉契
class Solution{public: /** * @param n: an integer * @return an integer f(n) */ int fibonacci(int n) { // write your code here int tmp[3]={0,1,原创 2015-11-16 23:42:05 · 366 阅读 · 0 评论 -
LintCode-剑指Offer-(371)用递归打印数字
class Solution {public: /** * @param n: An integer. * return : An array storing 1 to the largest number with n digits. */ vector<int> numbersByRecursion(int n) { //我感觉这道题有点显得原创 2015-11-21 22:48:03 · 555 阅读 · 0 评论 -
LintCode-剑指Offer-(38)搜索二维矩阵Ⅱ
class Solution {public:/*** @param matrix: A list of lists of integers * @param target: An integer you want to search in matrix * @return: An integer indicate the total occurrence of target in the原创 2015-11-20 23:36:52 · 310 阅读 · 0 评论 -
LintCode-剑指Offer-(69)二叉树的层次遍历
class Solution { /** * @param root: The root of binary tree. * @return: Level order a list of lists of integer */public: void lev(TreeNode* node, int levelnum, vector<vector<int>>&原创 2015-11-22 01:00:56 · 280 阅读 · 0 评论 -
LintCode-剑指Offer-(68)二叉树的后序遍历
/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right =原创 2015-11-22 00:05:59 · 280 阅读 · 0 评论