Tag: 算法与数据结构基础


  1. 每周一算法2017.11.10

    Merge Sorted Array 描述: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. …

    算法与数据结构基础继续阅读

  2. 每周一算法2017.10.27

    Plus one 描述 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 list. 中文:给定一个非负数,表示一个数字数组,在该数的基础上+1,返回一个新的数组。该数字按照大小进行排列,最大的数在列表的最…

    算法与数据结构基础继续阅读

  3. 每周一算法2017.10.16

    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 for another array, you must do this in place with constant m…

    算法与数据结构基础继续阅读