ThinkerQAQ

数组

Data Structures & Algorithms · 16 notes

  1. Search in a 2D Arrayhistorical

    Mirror translation of the original Sword Offer note: Search in a 2D Array.

  2. Two Numbers with Sum Shistorical

    Mirror translation of the original Sword Offer note: Two Numbers with Sum S.

  3. Continuous Positive Sequences with Sum Shistorical

    Mirror translation of the original Sword Offer note: Continuous Positive Sequences with Sum S.

  4. Last Remaining Number in a Circlehistorical

    Mirror translation of the original Sword Offer note: Last Remaining Number in a Circle.

  5. Arrange an Array into the Smallest Numberhistorical

    Mirror translation of the original Sword Offer note: Arrange an Array into the Smallest Number.

  6. Count Occurrences in a Sorted Arrayhistorical

    Mirror translation of the original Sword Offer note: Count Occurrences in a Sorted Array.

  7. Number Appearing More Than Half the Timehistorical

    Mirror translation of the original Sword Offer note: Number Appearing More Than Half the Time.

  8. Numbers Appearing Only Oncehistorical

    Mirror translation of the original Sword Offer note: Numbers Appearing Only Once.

  9. Inverse Pairs in an Arrayhistorical

    Mirror translation of the original Sword Offer note: Inverse Pairs in an Array.

  10. Duplicate Number in an Arrayhistorical

    Mirror translation of the original Sword Offer note: Duplicate Number in an Array.

  11. Minimum Number in a Rotated Arrayhistorical

    Mirror translation of the original Sword Offer note: Minimum Number in a Rotated Array.

  12. Smallest K Numbershistorical

    Mirror translation of the original Sword Offer note: Smallest K Numbers.

  13. Robot Movement Rangehistorical

    Mirror translation of the original Sword Offer note: Robot Movement Range.

  14. Maximum in Sliding Windowshistorical

    Mirror translation of the original Sword Offer note: Maximum in Sliding Windows.

  15. Reorder Array with Odd Numbers Before Even Numbershistorical

    Mirror translation of the original Sword Offer note: Reorder Array with Odd Numbers Before Even Numbers.

  16. Maximum Sum of a Contiguous Subarrayhistorical

    Mirror translation of the original Sword Offer note: Maximum Sum of a Contiguous Subarray.