云桥落羽

C++  class Solution { private: int min(int v1, int v2) { if (v1 > v2) { return v2; } return v1; } double getKth(vector<int>& nums1, vector<int>& nums2, int begin1,...

C++  class Solution { public: string longestPalindrome(string s) { int length = s.length(); int longset = 1; int index = 0; int right = 1; int left = 1; ...

C++  class Solution { public: string convert(string s, int numRows) { if(numRows==1){return s;} int length = s.length(); int nums = (numRows<<1) - 2; string ...

C++ class Solution { private: const static int MAX_INT = 2147483647; public: int reverse(int x) { bool mark = false; if(x < 0){ mark = true; x *= -1...

C++ class Solution { private: string subEmpty(string& s){ int length = s.length(); int begin = 0; int end = length; for(int i=0;i<length;i++){ i...

C++ class Solution { public: bool isPalindrome(int x) { if(x < 0){ return false; } int temp = x; int y = 0; while(temp > 0){ ...

C++ class Solution { public: int maxArea(vector<int>& height) { int begin = 0; int end = height.size() - 1; int res = 0; while(begin!=end){ ...

C++ class Solution { private: const char* l1[10] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}; const char* l2[10] = {"&quot

C++ class Solution { public: int romanToInt(string s) { int length = s.length(); int res = 0; for(int i=0;i<length;i++){ if(s[i]=='M'){ res...

C++  class Solution { public: int lengthOfLongestSubstring(string s) { int num = s.length(); int result = 0; int begin = 0; for (int end = 0; end < num; end++) { for (int index = begin...

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

C /** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { int *result = (int *)malloc(2*sizeof(int)); // 嵌套遍历 fo...

C++ class Solution { public: string longestCommonPrefix(vector<string>& strs) { if(strs.size()==0){return "";} string res = ""; int size = strs.size(); ...