m0_37303351的博客

class Solution {public:double find_mean(vector<int>&nums){ int me; double result; double er=2; if(nums.size()%2==0){ me=nums.size()/2; result= (nums[me-1]+...

class Solution {public: int lengthOfLongestSubstring(string s) { int flag=0; int count=0; int l=0; int result=1; int differ=0; if(s=="") return 0...

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution {public:    ListNod...

这个是最开始写的brutal answer. 遍历所有子串，算法效率不高，虽然结果正确，但在LeetCode上time limit exceeded。下一篇附上改进代码。class Solution {public: bool isPalindromic(string s){ for(int i=0;i<s.size();i++){ i...