Hard??没搞错吧,LeetCode水题一道:Find Minimum in Rotated Sorted Array II
来源:互联网 发布:银行业数据治理的问题 编辑:程序博客网 时间:2024/06/05 18:34
做完Find Minimum in Rotated Sorted Array I觉得很简单,再做2发现也不难,但是LeetCode竟然给了一个hard评级,难道是我编程水平大有长进?哈哈我估计是对复杂度有很高的要求的情况下比较难吧。。
Python(偷懒)做法就是一句话:return min(num)
Java(基本做法)如下:
public class Solution { public int findMin(int[] num) { int len=num.length; if (len==0) return 0; else if (len==1) return num[0]; else{ for (int i=0;i<len-1;i++){ if (num[i]>num[i+1]) return num[i+1]; } } return num[0]; }}平均、最差时间复杂度都是O(n)。思路很简单,就是顺序依次比较,如果后者小于前者,则后者一定是最小的,输出即可。如果不是则继续比较。
牛逼做法:请出门左拐,这里没有。
0 0
- Hard??没搞错吧,LeetCode水题一道:Find Minimum in Rotated Sorted Array II
- [Leetcode 154, Hard] Find Minimum in Rotated Sorted Array II
- LeetCode 154. Find Minimum in Rotated Sorted Array II (Hard)
- Hard 154题 Find Minimum in Rotated Sorted Array II
- 154. Find Minimum in Rotated Sorted Array II[hard]
- 154. Find Minimum in Rotated Sorted Array II Hard
- LeetCode Find Minimum in Rotated Sorted Array & LeetCode Find Minimum in Rotated Sorted Array II
- 154.leetcode Find Minimum in Rotated Sorted Array II(hard)[排序数组 重复元素 二分查找]
- leetCode -Array 154. Find Minimum in Rotated Sorted Array II
- [Leetcode]Find Minimum in Rotated Sorted Array I & II
- LeetCode 154 Find Minimum in Rotated Sorted Array II
- [LeetCode] Find Minimum in Rotated Sorted Array II
- LeetCode: Find Minimum in Rotated Sorted Array II
- 【Leetcode】Find Minimum in Rotated Sorted Array II
- Find Minimum in Rotated Sorted Array II -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array II
- LeetCode之Find Minimum in Rotated Sorted Array II
- leetcode Find Minimum in Rotated Sorted Array II
- Ambari安装指南
- Oracle Sequence Cache 参数说明
- Android中ListView与RadioButton结合----自定义单选列表
- java中的static
- 守护进程
- Hard??没搞错吧,LeetCode水题一道:Find Minimum in Rotated Sorted Array II
- 安卓挂电话解析
- 2015真的来了呀
- Android原理——动态代码布局
- CentOS6.6下Samba环境搭建
- unreachable remote address [akka.tcp://sparkMaster@localhost:7077]解决方法
- 设计模式--构造者模式
- Office2010 下载
- CAS、Spring Security、Ldap配置整合(资料整合)