摘要:
题目描述: 解法一: class Solution {public: static bool comp(vector& a, vector& b){ return a[0]>& points) { if(points.emp... 阅读全文
posted @ 2019-08-31 19:56
DH_HUSTer
阅读(18)
评论(0)
推荐(0)
摘要:
题目描述: 解法: class Solution {public: string frequencySort(string s) { unordered_map ump; for (const auto& str : s) ... 阅读全文
posted @ 2019-08-31 19:17
DH_HUSTer
阅读(20)
评论(0)
推荐(0)
摘要:
题目描述: 解法一(递归搜索)(超时): class Solution {public: bool canWin(const int& maxChoosableInteger, int desired, unordered_map record) { ... 阅读全文
posted @ 2019-08-31 19:02
DH_HUSTer
阅读(17)
评论(0)
推荐(0)
摘要:
题目描述: 解法: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)... 阅读全文
posted @ 2019-08-31 16:12
DH_HUSTer
阅读(18)
评论(0)
推荐(0)
摘要:
题目描述: 解法一(DP): class Solution {public: int maxSubArray(vector& nums) { if(nums.size()==1) return nums[0]; int r... 阅读全文
posted @ 2019-08-31 15:45
DH_HUSTer
阅读(15)
评论(0)
推荐(0)
摘要:
题目描述: 解法一(头节点另处理): /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNo... 阅读全文
posted @ 2019-08-31 15:18
DH_HUSTer
阅读(17)
评论(0)
推荐(0)
摘要:
题目描述: 解法: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)... 阅读全文
posted @ 2019-08-31 12:54
DH_HUSTer
阅读(20)
评论(0)
推荐(0)
摘要:
题目描述: 解法一(迭代): /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode... 阅读全文
posted @ 2019-08-31 12:04
DH_HUSTer
阅读(22)
评论(0)
推荐(0)