Leetcode
六炅
这个作者很懒,什么都没留下…
展开
-
Reverse Interget
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321Have you thought about this? Here are some good questions to ask before coding. Bonus points for you if you h原创 2017-03-04 14:28:03 · 334 阅读 · 0 评论 -
判断Int类型数据是否溢出
今天在leetcode上做题时,又遇到了与数据溢出相关的内容,在此记录下吧。 在头文件“limits.h”中有各种基本数据类型的最大最小值。/* Minimum and maximum values a `signed int' can hold. */# define INT_MIN (-INT_MAX - 1)# define INT_MAX 2147483647/* Max原创 2017-03-05 18:40:30 · 11589 阅读 · 0 评论 -
atoi
Implement atoi to convert a string to an integer.class Solution {public: int myAtoi(string str) { int sum = 0; bool flag = true; for (int j=0; j<str.size(); ) {原创 2017-03-05 17:08:03 · 271 阅读 · 0 评论 -
License Key Formatting
Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerica原创 2017-03-05 14:59:14 · 350 阅读 · 0 评论 -
Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional原创 2017-03-08 19:29:46 · 244 阅读 · 0 评论 -
Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct ListNode原创 2017-03-08 19:01:43 · 281 阅读 · 0 评论 -
Roman to Interger
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999class Solution {public: int romanToInt(string s) { map<char, int> roman; ro原创 2017-03-04 15:13:15 · 261 阅读 · 0 评论 -
Add Two Number II
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it原创 2017-03-04 14:53:15 · 384 阅读 · 0 评论 -
Add Two Number
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it原创 2017-03-04 14:51:51 · 333 阅读 · 0 评论 -
Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.class Solution {public: bool isPalindrome(int x) { if (x<0 || (x!=0 && x%10==0)) return false;原创 2017-03-04 14:51:02 · 250 阅读 · 0 评论 -
Int to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.class Solution {public: string intToRoman(int num) { map<int, string> roman;原创 2017-03-06 16:09:24 · 393 阅读 · 0 评论