摘要： Given a sorted integer array without duplicates, return the summary of its ranges.For example, given[0,1,2,4,5,7], return["0->2","4->5","7"].class Sol... 阅读全文

摘要： 题意：Given an array of integers and an integerk, find out whether there are two distinct indicesiandjin the array such thatnums[i] = nums[j]and the diff... 阅读全文

摘要： 我的思路：二进制位上有1则加class Solution {public: vector> subsets(vector& nums) { vector> res; sort(nums.begin(),nums.end()); for(int i=0;... 阅读全文

摘要： class Solution {public: int num=0; bool isgo=true;public: string getPermutation(int n, int k) { vector nums; for(int i=1;i> res; ... 阅读全文

摘要： class Solution {public: vector> permute(vector& nums) { sort(nums.begin(),nums.end()); vector> res; vector path; trackb... 阅读全文

摘要： class Solution {public: vector > solveNQueens(int n) { vector> xxx; vector > res; vector com; int len=n; c3(res,com,n,len... 阅读全文

摘要： class Solution {public: map coll; vector vec;public: vector letterCombinations(string digits) { if(digits.length()==0) return vec... 阅读全文

摘要： http://blog.csdn.net/mxw976235955/article/details/39829973http://www.tuicool.com/articles/zA7NJbj/** *morris中序遍历二叉树 */void morris_inorder(BiTree T) { ... 阅读全文

摘要： #include #include using namespace std; void print(int *arr, int start, int end) { for (int i = start; i arr[j]) { k = j; key = arr[j]; whi... 阅读全文