摘要:
[抄题]: Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must e 阅读全文
posted @ 2018-08-01 21:45
苗妙苗
阅读(148)
评论(0)
推荐(0)
摘要:
[抄题]: Compare two version numbers version1 and version2.If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0. You may 阅读全文
posted @ 2018-08-01 16:57
苗妙苗
阅读(170)
评论(0)
推荐(0)
摘要:
[抄题]: You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes 阅读全文
posted @ 2018-08-01 15:37
苗妙苗
阅读(178)
评论(0)
推荐(0)
摘要:
[抄题]: Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: Construct the maximum tree by the given a 阅读全文
posted @ 2018-08-01 11:30
苗妙苗
阅读(131)
评论(0)
推荐(0)