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];…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 寻找两次最大值 排序 大顶堆 日期 题目地址:https://leetcode.com/problems/largest-number-at-least-twice-of-others/description/ 题目描述 In a given integer array nums, there is always exactly one larges…

原题地址: https://oj.leetcode.com/problems/largest-number/ 题目内容: Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The result may…

Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The result may be very large, so you need to return a string instead of an i…

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 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[]&…

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 762. Prime Number of Set Bits in Binary Representation solution1: class Solution { public: int countPrimeSetBits(int L, int R) { int res = 0; int bits = 0; for(int i=L; i<=R; i++) { bits = countBits(i); if(isPrime(bits) && bits!=1 ) res…

problem 693. Binary Number with Alternating Bits solution1: class Solution { public: bool hasAlternatingBits(int n) { ; ) { /* errr... if(n&1 && bit==1) return false; else if(n&1) bit = 1; if(n&1==0 && bit==0) return false; els…

[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…