算法
Wang_Tian_Ze
一直在路上
展开
-
数组中占比超过一半的元素称之为主要元素。给定一个整数数组,找到它的主要元素。若没有,返回-1
数组中占比超过一半的元素称之为主要元素。给定一个整数数组,找到它的主要元素。若没有,返回-1。示例 1:输入:[1,2,5,9,5,9,5,5,5]输出:5示例 2:输入:[3,2]输出:-1示例 3:输入:[2,2,1,1,1,2,2]输出:2来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/find-majority-element-lcci著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。package c原创 2021-04-07 16:13:27 · 987 阅读 · 0 评论 -
给你一个二维整数数组 matrix,返回 matrix 的 转置矩阵
给你一个二维整数数组 matrix, 返回 matrix 的 转置矩阵 。矩阵的 转置 是指将矩阵的主对角线翻转,交换矩阵的行索引与列索引。示例 1:输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]输出:[[1,4,7],[2,5,8],[3,6,9]]示例 2:输入:matrix = [[1,2,3],[4,5,6]]输出:[[1,4],[2,5],[3,6]]提示:m == matrix.lengthn == matrix[i].length1 <=原创 2021-04-07 12:54:32 · 1252 阅读 · 1 评论 -
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array,原创 2017-09-15 13:48:46 · 215 阅读 · 0 评论 -
Remove Element
Give an arry and a value,remove all instances of that>value in place and return the new length. The order of elements can be changed.It doesn’t matter what you leave beyond the new length.#include<std原创 2017-09-16 09:11:26 · 165 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
/* Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo原创 2017-09-18 11:02:46 · 370 阅读 · 0 评论 -
PlusOne
Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the listclass PlusOne{public: ve原创 2017-09-19 15:07:53 · 377 阅读 · 0 评论