zoukankan      html  css  js  c++  java
  • leetcode

    Coding on LeetCode Online Judge

    leetcode(leetcode website)

    a13

    question: Roman to Integer
    my answer


    Given a roman numeral, convert it to an integer.

    Input is guaranteed to be within the range from 1 to 3999.

    a12

    question: Integer to Roman
    my answer1|my answer2|my answer3


    Given an integer, convert it to a roman numeral.

    Input is guaranteed to be within the range from 1 to 3999.

    a11

    question: Container With Most Water
    my answer


    Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

    a10

    question: Palindrome Number
    my answer


    Implement regular expression matching with support for '.' and '*'.

    '.' Matches any single character.

    '*' Matches zero or more of the preceding element.

    The matching should cover the entire input string (not partial).

    The function prototype should be:

    bool isMatch(const char *s, const char *p)

    Some examples:

    isMatch("aa","a") → false

    isMatch("aa","aa") → true

    isMatch("aaa","aa") → false

    isMatch("aaaaa", "a") → true

    isMatch("aa", ".
    ") → true

    isMatch("ab", ".") → true

    isMatch("aab", "c
    a*b") → true

    a9

    question: Palindrome Number
    my answer


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

    a8

    question: String to Integer (atoi)
    my answer


    Implement atoi to convert a string to an integer.

    Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

    a7

    question: Reverse Integer
    my answer


    Reverse digits of an integer.

    Example1: x = 123, return 321

    Example2: x = -123, return -321

    a6

    question: ZigZag Conversion
    my answer


    The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

    P    A    H   N

    A P L S I  I  G

    Y   I    R

    And then read line by line: "PAHNAPLSIIGYIR"

    Write the code that will take a string and make this conversion given a number of rows:

    string convert(string text, int nRows);

    convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".

    a5

    question: Longest Palindromic Substring
    my answer


    Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

    a4

    question: Median of Two Sorted Arrays
    my answer


    There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

    a3

    question: Longest Substring Without Repeating Characters

    my answer and leetcode answer


    Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

    a2

    question: Add Two Numbers
    my answer


    You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

    Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
    Output: 7 -> 0 -> 8

    a1

    question: Two Sum
    my answer


    Given an array of integers, return indices of the two numbers such that they add up to a specific target.

    You may assume that each input would have exactly one solution.

    Example:
    Given nums = [2, 7, 11, 15], target = 9,

    Because nums[0] + nums[1] = 2 + 7 = 9,
    return [0, 1].

    About Me

    Email: ityoung@126.com

  • 相关阅读:
    分时区查询问题解决
    .htaccess伪静态实例分享
    net mvc 小目标
    PHP中钩子函数的实现与认识
    session
    修改net基本三层 动软生产
    格式化问题
    数据字典
    关联数据和formatter问题-easyui+微型持久化工具
    说说JSON和JSONP,也许你会豁然开朗
  • 原文地址:https://www.cnblogs.com/ityoung/p/5396160.html
Copyright © 2011-2022 走看看