- 博客(7)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode-07 整数反转
C语言版本和C++版本几乎一样，就直接上C语言版本。 int reverse(int x) { int temp = x; int y; int sum = 0; while(temp!=0) { y = temp % 10; temp = temp / 10; if(sum>...
2018-11-28 17:09:17
546
原创 LeetCode-06 Z字形变换
C++版本 class Solution { public: string convert(string s, int numRows) { if (numRows <= 1) return s; string res = ""; int size = 2 * numRows - 2; for (int i = 0; i ...
2018-11-26 14:24:43
434
原创 LeetCode-05最长回文子串
C++ class Solution { public: string longestPalindrome(string s) { if (s.empty()) return ""; int dp[s.size()][s.size()] = {0}, left = 0, right = 0, len = 0; for (int i = 0...
2018-11-16 16:11:14
370
原创 LeetCode-4两数相加
C版本 int getMax(int a, int b) { return a>=b?a:b; } int getMin(int a, int b) { return a>=b?b:a; } double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size) { ...
2018-11-14 14:01:17
342
原创 LeetCode 03-无重复字符的最长子串
C版本1 int getmax(int a,int b); int lengthOfLongestSubstring(char* s) { int nowlength=0,maxlength=0; int i,j; int begini=0,endi=0; while(s[endi]!=NULL&&s[endi+1]!=NULL) ...
2018-11-07 18:59:52
346
原创 LeetCode-02两数相加
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* a...
2018-11-06 10:42:46
273
原创 LeetCode-01两数之和
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> m; for (int i = 0; i < nums.size(); ++i) { ...
2018-11-06 10:40:19
293
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人