摘要:
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. Note: 代码的主要思路就是一位一位相加。具体代码实现过程如下。 但是关注了一下,评论区大神的 阅读全文
摘要:
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a lette 阅读全文
摘要:
Given a 32-bit signed integer, reverse digits of an integer. Example 1: Example 2: Example 3: Note:Assume we are dealing with an environment which cou 阅读全文
摘要:
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 ex 阅读全文
摘要:
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 阅读全文
摘要:
Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 每次相加的时候每位会出现0,1 ,2 ,3的情况,其对应的二进制是0,1,0,1.所 阅读全文
摘要:
We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). N 阅读全文