lintcode.h

浏览该文件的文档.

#ifndef PROBLEMSCPP_LINTCODE_H
#define PROBLEMSCPP_LINTCODE_H
 
#include <string>
#include <vector>
 
using namespace std;
 
namespace lintcode {
    class TreeNode {
    public:
        int val;
        TreeNode *left, *right;
 
        explicit TreeNode(int val)
            : val(val), left(nullptr), right(nullptr){};
    };
 
    namespace license_key_formatting {
        class Solution {
        public:
            static string licenseKeyFormatting(string & /*S*/, int /*K*/);
        };
    }// namespace license_key_formatting
 
    namespace distribute_candies {
        class Solution {
        public:
            static int distributeCandies(vector<int> &candies);
        };
    }// namespace distribute_candies
 
    namespace remove_extra {
        class Solution {
        public:
            static string removeExtra(string &s);
        };
    }// namespace remove_extra
 
    namespace character_deletion {
        class Solution {
        public:
            static string CharacterDeletion(string &str, string &sub);
        };
    }// namespace character_deletion
 
    namespace judge_circle {
        class Solution {
        public:
            static bool judgeCircle(string &moves);
        };
    }// namespace judge_circle
 
    namespace intersection {
        class Solution {
        public:
            static vector<vector<int>> Intersection(vector<vector<int>> &a, vector<vector<int>> &b);
 
            static bool is_intersected(const vector<int> &l, const vector<int> &r);
        };
    }// namespace intersection
 
    namespace flatten {
        class Solution {
        public:
            static void flatten(TreeNode *root);
 
            static TreeNode *vlr(TreeNode * /*node*/);
        };
    }// namespace flatten
 
    namespace convert {
        class Solution {
        public:
            static string convert(long long index);
        };
    }// namespace convert
 
    namespace min_path_sum {
        class Solution {
        public:
            static int minPathSum(vector<vector<int>> &grid);
        };
    }// namespace min_path_sum
 
    namespace digit_counts {
        class Solution {
        public:
            static int digitCounts(int k, int n);
        };
    }// namespace digit_counts
 
    namespace min_diff_in_BST {
        class Solution {
        public:
            static int minDiffInBST(TreeNode *root);
        };
    }// namespace min_diff_in_BST
}// namespace lintcode
 
#endif//PROBLEMSCPP_LINTCODE_H