摘要:
排列组合类的问题,可以使用经典递归方法和分段迭代法 描述 Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not cont 阅读全文
摘要:
前言 这里总结了两道表格移动的问题,分别是:Unique Paths 和 题一:Unique Paths 描述 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below 阅读全文
摘要:
描述 Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations perm 阅读全文
摘要:
描述: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: 阅读全文
摘要:
描述 You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, wh 阅读全文