240 发简信
violinmeng
IP属地：北京
  • 动态规划（dynamic programming)（上）

    本文根据Hawstein的BLOG，加入了自己的一些代码实现和理解。概括：动态规划算法通常基于一个递推公式及一个或多个初始状态。 当前子问题的解...

    1589 0 2
  • Palindrome Number

    Determine whether an integer is a palindrome. Do this without extra spac...

    237 0 0
  • String to Integer (atoi)

    Implement atoi to convert a string to an integer.实现atoi，把一个字符串转换为整数。Hint...

    339 0 0
  • Reverse Integer

    Reverse digits of an integer.反转整数数字。Example1: x = 123, return 321Example...

    325 0 0
  • ZigZag Conversion

    The string "PAYPALISHIRING" is written in a zigzag pattern on a given nu...

    191 0 0
  • Resize,w 360,h 240
    Longest Palindromic Substring

    Given a string S, find the longest palindromic substring in S. You may a...

    262 0 0
  • Median of Two Sorted Arrays

    There are two sorted arrays nums1 and nums2 of size m and n respectively...

    259 0 0
  • Longest Substring Without Repeating Characters

    Given a string, find the length of the longest substring without repeati...

    483 0 0
  • Add Two Num

    You are given two linked lists representing two non-negative numbers. Th...

    1556 0 0
暂无个人介绍