problem 949. Largest Time for Given Digits solution: class Solution { public: string largestTimeFromDigits(vector<int>& A) { sort(A.begin(), A.end(), greater<int>());//errr..largest.. do { ]< || (A[]==&&A[]<)) && A[]&…

题目如下: Given an array of 4 digits, return the largest 24 hour time that can be made. The smallest 24 hour time is 00:00, and the largest is 23:59.  Starting from 00:00, a time is larger if more time has elapsed since midnight. Return the answer as a s…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 日期 题目地址:https://leetcode.com/problems/largest-time-for-given-digits/description/ 题目描述 Given an array of 4 digits, return the largest 24 hour time that can be made. The smallest…

problem 976. Largest Perimeter Triangle solution: class Solution { public: int largestPerimeter(vector<int>& A) { sort(A.begin(), A.end());//decrease. ; i>; i--) { ]+A[i-]) ]+A[i-]; } ; } }; 参考 1. Leetcode_easy_976. Largest Perimeter Triangle…

problem 812. Largest Triangle Area solution: class Solution { public: double largestTriangleArea(vector<vector<int>>& points) { double res = 0.0; , y1=, x2=, y2=, x3=, y3=; ; i<points.size(); ++i) { ; j<points.size(); ++j) { ; k<p…

problem 747. Largest Number At Least Twice of Others 题意: solution1: class Solution { public: int dominantIndex(vector<int>& nums) { , secondMx = -, mxId = -;//err... ) ; ; i<nums.size(); i++) { if(nums[i]>mx) { secondMx = mx; mx = nums[i];…

[LeetCode]764. Largest Plus Sign 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/largest-plus-sign/description/ 题目描述: In a 2D grid from (0, 0) to (N-1, N-1), every cell contains a 1, except thos…

[LeetCode]813. Largest Sum of Averages 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/largest-sum-of-averages/description/ 题目描述: We partition a row of numbers A into at most…

problem 703. Kth Largest Element in a Stream 题意: solution1: priority_queue这个类型没有看明白... class KthLargest { public: KthLargest(int k, vector<int>& nums) { for(int num:nums) { q.push(num); if(q.size()>k) q.pop(); } K = k; } int add(int val) { q.…

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For example,Given [3,2,1,5,6,4] and k = 2, return 5. 思路: 堆.讲解:二叉堆 class Solution { public: //新插入i结点 其父节点为(i…