ss654271961的博客

题目描述 Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 思路 主要问题在于两个字符串谁长谁短，短的那个之后就要被看做0.然后就是计算，可以转化为int计算,更简便的是直接用char-'0',(cha

原题描述 3.Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which