zy_gyj的博客

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)).Example 1:nums1 = [1, 3]nums2...

class Solution: #最长公共前缀 def longestCommonPrefix(self, strs: List[str]) -> str: a = "" if not strs: return '' for i in range(len(strs[0])): f...

class Solution: def romanToInt(self, s: str) -> int: if 'IV' or 'IX' or 'XL' or 'XC' or 'CD' or 'CM' in s: s= s.replace('IV','4 ') s=s.replace('IX','9 ') ...

class Solution: def isPalindrome(self, x: int) -> bool: y=x #当x为0,成立 if x==0: return True #当x<0或是10的倍数，不成立 if x < 0 or x%10 == 0: ...

Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21class Solution: de...

题目：给定两个非负整数的链表。数字以相反的顺序存储，每个节点包含一个数字。将这两个数字相加，并作为链表返回Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)Output: 7 -> 0 -> 8Explion: 342 + 465 = 807.思路：先将两个链表均表示为数字，数字进行相加，再将数字转换为链表输出直接...

题目：输入一个数组和target，要在一个数组中找到两个数字，其和为target，从小到大输出数组中两个数字的位置。给定数组：nums = [2, 7, 11, 15], 数值：target = 9,使得：nums[0] + nums[1] = 2 + 7 = 9,返回：return [0, 1]暴力搜索--循环，时间复杂度n*nclass Solution(object):...

给定索引k，返回帕斯卡三角形的第k行。例如，给定k = 3，返回[1,3,3,1]。注意：您可以优化您的算法以仅使用O（k）额外空间吗？         public static List&lt;Integer&gt; getRow(int rowIndex) {        List&lt;Integer&gt; row = new ArrayList&lt;Integer&gt;(); ...

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digits are s...

Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with the l...

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 i...

以k个步骤向右旋转n个元素的数组。例如，当n = 7和k = 3时，数组[1,2,3,4,5,6,7]被旋转到[5,6,7,1,2,3,4]。package leetcode;public class leetcode9 { public void reverse(int[] nums,int start,int end) { while(start&lt;end) { int temp=...

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Exam...

day1: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, and you may not use the sa...

给定一个32位有符号整数，整数的反转数字。例1：输入： 123 输出： 321例2：输入： -123 输出： -321例3：输入： 120输出： 21public static int reverse1(int x) { long result=0; while(x!=0) { result=(result*10)+(x%10); if(result&gt;Integ...

class Solution: def strStr(self, haystack: str, needle: str) -> int: if needle =="": return 0 if len(haystack) == len(needle): if haystack == needle: ...