發(fā)簡信
IP屬地：北京
-
動態(tài)規(guī)劃（dynamic programming)（上）
本文根據Hawstein的BLOG，加入了自己的一些代碼實現和理解。概括：動態(tài)規(guī)劃算法通?；谝粋€遞推公式及一個或多個初始狀態(tài)。 當前子問題的解...
-
Palindrome Number
Determine whether an integer is a palindrome. Do this without extra spac...
-
String to Integer (atoi)
Implement atoi to convert a string to an integer.實現atoi，把一個字符串轉換為整數。Hint...
-
Reverse Integer
Reverse digits of an integer.反轉整數數字。Example1: x = 123, return 321Example...
-
ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given nu...
-
Longest Palindromic SubstringGiven a string S, find the longest palindromic substring in S. You may a...
-
Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively...
-
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeati...
-
Add Two Num
You are given two linked lists representing two non-negative numbers. Th...