Metsa的专栏

Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where

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 link

int lengthOfLongestSubstring(string s) { int n = s.size(); if (n <= 1) { return n; } int i = 0;//start of the current checking string int j = 1;//end of the current checking string int len =

string findLongestPalindrome(string & str){ size_t n = str.size(); size_t max_length = 0; size_t len = 0; size_t start = 0; if(n <= 1){ return str; } for(size_

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

int myAtoi(string str) { double x = 0; bool neg = false; int index = 0; int len = str.size(); bool foundNumber = false; while (index < len ) { //if str start with spaces if (str[index] ==