Troy_Daisy的博客

题目：给定一个非负整数num， 重复将其各个位数上的数字进行求和操作，直到结果为1-9的数（个位数）为止。比如： 给出num = 38 , 计算过程如下： 3 + 8 = 11 ， 1 + 1 = 2,  因为2 为个位数， 返回。要求：在 不用循环或递归的情况下，时间复杂度为O(1)  ？一开始，没什么思路，就手动计算几个数看看。输入：1,2,3,4,5,6,7,8,9,

121. Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie,

136.Single Number IGiven an array of integers, every element appears twiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implemen

283. Move ZeroesGiven an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], a

题目：Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(

题目：Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm should