Typing 第9页

LeetCode: Unique Paths

一次过 1 class Solution { 2 public: 3 int uniquePaths(int m, int n) { 4 // Start typing

·2015-11-13 11:43

LeetCode: Unique Binary Search Trees

一上来就知道用dp，一次过 1 class Solution { 2 public: 3 int numTrees(int n) { 4 // Start typing

·2015-11-13 11:42

LeetCode: Two Sum

3 vector<int> twoSum(vector<int> &numbers, int target) { 4 // Start typing

·2015-11-13 11:41

LeetCode: Triangle

public: 3 int minimumTotal(vector<vector<int> > &triangle) { 4 // Start typing

·2015-11-13 11:40

LeetCode: Trapping Rain Water

1 class Solution { 2 public: 3 int trap(int A[], int n) { 4 // Start typing your C/

·2015-11-13 11:39

LeetCode: String to Integer (atoi)

int范围，多数次过 1 class Solution { 2 public: 3 int atoi(const char *str) { 4 // Start typing

·2015-11-13 11:32

LeetCode: Sqrt(x)

一点小失误，基本一次过吧 1 class Solution { 2 public: 3 int sqrt(int x) { 4 // Start typing

·2015-11-13 11:32

LeetCode: Simplify Path

这种麻烦的题目就是考你有没有考虑到所有情况 1 class Solution { 2 public: 3 string simplifyPath(string path) { 4 // Start typing

·2015-11-13 11:29

LeetCode: Sort Colors

不太容易想出来 1 class Solution { 2 public: 3 void sortColors(int A[], int n) { 4 // Start typing

·2015-11-13 11:29

LeetCode: Search in Rotated Sorted Array II

class Solution { 2 public: 3 bool search(int A[], int n, int target) { 4 // Start typing

·2015-11-13 11:27

LeetCode: Search Insert Position

Solution { 2 public: 3 int searchInsert(int A[], int n, int target) { 4 // Start typing

·2015-11-13 11:27

LeetCode: Search in Rotated Sorted Array

class Solution { 2 public: 3 int search(int A[], int n, int target) { 4 // Start typing

·2015-11-13 11:26

LeetCode: Search for a Range

2 public: 3 vector<int> searchRange(int A[], int n, int target) { 4 // Start typing

·2015-11-13 11:25

LeetCode: Search a 2D Matrix

bool searchMatrix(vector<vector<int> > &matrix, int target) { 4 // Start typing

·2015-11-13 11:24

LeetCode: Rotate Image

2 public: 3 void rotate(vector<vector<int> > &matrix) { 4 // Start typing

·2015-11-13 11:22

LeetCode: Reverse Integer

一次过 1 class Solution { 2 public: 3 int reverse(int x) { 4 // Start typing your C

·2015-11-13 11:19

7月份文章回顾

id=7996028 Sick of Ruby, dynamic typing, side effects, and basically object-oriented programming： https

·2015-11-13 10:00

LeetCode: Remove Element

class Solution { 2 public: 3 int removeElement(int A[], int n, int elem) { 4 // Start typing

·2015-11-13 10:38

LeetCode: Remove Duplicates from Sorted Array II

1 class Solution { 2 public: 3 int removeDuplicates(int A[], int n) { 4 // Start typing

·2015-11-13 10:36

LeetCode: Remove Duplicates from Sorted Array

1 class Solution { 2 public: 3 int removeDuplicates(int A[], int n) { 4 // Start typing

·2015-11-13 10:35

LeetCode: Pow(x, n)

看了这个强大的代码 1 class Solution { 2 public: 3 double pow(double x, int n) { 4 // Start typing

·2015-11-13 10:34

LeetCode: Plus One

2 public: 3 vector<int> plusOne(vector<int> &digits) { 4 // Start typing

·2015-11-13 10:31

LeetCode: Permutation Sequence

1 class Solution { 2 public: 3 string getPermutation(int n, int k) { 4 // Start typing

·2015-11-13 10:29

LeetCode: Pascal's Triangle II

class Solution { 2 public: 3 vector<int> getRow(int rowIndex) { 4 // Start typing

·2015-11-13 10:27

LeetCode: Pascal's Triangle

{ 2 public: 3 vector<vector<int> > generate(int numRows) { 4 // Start typing

·2015-11-13 10:26

LeetCode: Palindrome Number

一点小失误，基本一次过吧 1 class Solution { 2 public: 3 bool isPalindrome(int x) { 4 // Start typing

·2015-11-13 10:24

LeetCode: Next Permutation

Solution { 2 public: 3 void nextPermutation(vector<int> &num) { 4 // Start typing

·2015-11-13 10:20

LeetCode: Minimum Window Substring

1 class Solution { 2 public: 3 string minWindow(string S, string T) { 4 // Start typing

·2015-11-13 10:18

LeetCode: Minimum Path Sum

2 public: 3 int minPathSum(vector<vector<int> > &grid) { 4 // Start typing

·2015-11-13 10:17

LeetCode: Merge Sorted Array

class Solution { 2 public: 3 void merge(int A[], int m, int B[], int n) { 4 // Start typing

·2015-11-13 10:15

LeetCode: Maximum Subarray

1 class Solution { 2 public: 3 int maxSubArray(int A[], int n) { 4 // Start typing

·2015-11-13 10:12

LeetCode: Longest Substring Without Repeating Characters

class Solution { 2 public: 3 int lengthOfLongestSubstring(string s) { 4 // Start typing

·2015-11-13 10:10

LeetCode: Longest Palindromic Substring

1 class Solution { 2 public: 3 string longestPalindrome(string s) { 4 // Start typing

·2015-11-13 10:09

LeetCode: Longest Common Prefix

2 public: 3 string longestCommonPrefix(vector<string> &strs) { 4 // Start typing

·2015-11-13 10:08

LeetCode: Longest Consecutive Sequence

Solution { 2 public: 3 int longestConsecutive(vector<int> &num) { 4 // Start typing

·2015-11-13 10:08

LeetCode: Length of Last Word

1 class Solution { 2 public: 3 int lengthOfLastWord(const char *s) { 4 // Start typing

·2015-11-13 10:06

LeetCode: Jump Game II

最后过了，少数次过吧 1 class Solution { 2 public: 3 int jump(int A[], int n) { 4 // Start typing

·2015-11-13 10:05

LeetCode: Jump Game

，两次过 1 class Solution { 2 public: 3 bool canJump(int A[], int n) { 4 // Start typing

·2015-11-13 10:04

LeetCode: Interleaving String

Solution { 2 public: 3 bool isInterleave(string s1, string s2, string s3) { 4 // Start typing

·2015-11-13 10:03

LeetCode: Gray Code

1 class Solution { 2 public: 3 vector<int> grayCode(int n) { 4 // Start typing

·2015-11-13 10:01

LeetCode: First Missing Positive

class Solution { 2 public: 3 int firstMissingPositive(int A[], int n) { 4 // Start typing

·2015-11-13 10:58

LeetCode: Edit Distance

class Solution { 2 public: 3 int minDistance(string word1, string word2) { 4 // Start typing