摘要:
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1: Input: [3,0,1] Output 阅读全文
posted @ 2018-06-09 20:45
干炸牛_bian
阅读(111)
评论(0)
推荐(0)
摘要:
Given 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. Example: Input: 阅读全文
posted @ 2018-06-09 17:26
干炸牛_bian
阅读(108)
评论(0)
推荐(0)
摘要:
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non-decr 阅读全文
posted @ 2018-06-09 16:03
干炸牛_bian
阅读(121)
评论(0)
推荐(0)
摘要:
Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian 阅读全文
posted @ 2018-06-09 14:12
干炸牛_bian
阅读(69)
评论(0)
推荐(0)
浙公网安备 33010602011771号