• ai tackles medicines

    artificial intelligence helps you understand world better

  • slide indexing and recognizing by image similarity analysis

    each individual patient could be deemed as a matrix complex the individual matrix (say it diagnosis) could be indicated or determined by some “endogenous” matrixes or vectors (i.e.radiomics, slides, mRNA, protein, methylation, TMB or non-coding RNAs) the individual matrix could also be changed or modified by certain interventions such as diet, exercises, medicines, radiotherapy or…

  • LEETCODE 0007

    QUERY7 reverse integerGiven a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed32-bit integer range [-231, 231 – 1], then return 0. Assume the environment does not allow you to store 64-bit integers (signed or unsigned).Example 1:Input: x = 123Output: 321 PYTHON: class…

  • LEETCODE 0006

    QUERY: 6. Zigzag ConversionThe string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I GY I RAnd then read line by line: “PAHNAPLSIIGYIR”Write the code that will…

  • LEETCODE 0005

    QUERY:5. Longest Palindromic SubstringGiven a string s, return the longest palindromic substring in s. example1:Input: s = “babad”Output: “bab”Explanation: “aba” is also a valid answer. PYTHON JAVA } C++: JKB // Author: Huahua, 16 ms, 8.7 MBclass Solution {public:string longestPalindrome(string s) {const int n = s.length();auto getLen = [&](int l, int r) {while (l >=…

  • LEETCODE 0004

    QUERY: 4. Median of Two Sorted ArraysGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.The overall run time complexity should be O(log (m+n)).example 1Input: nums1 = [1,3], nums2 = [2]Output: 2.00000Explanation: merged array = [1,2,3] and median is 2. PYTHON JAVA C++ NOTE:

  • LEETCODE 0003

    Longest Substring Without Repeating Characters

  • LEETCODE 0002

    Add Two Numbers

  • LEETCODE 0001

    PYTHON: class Solution2(object):def twoSum(self, nums, target):“””:type nums: List[int]:type target: int:rtype: List[int]“””lookup = {}for i, num in enumerate(nums):if target – num in lookup:return [lookup[target – num], i]lookup[num] = ireturn [] if name == ‘main‘:print(Solution().twoSum((2, 7, 11, 15), 9)) class solution1(object):def twosum(self, nums, target):l = len(nums)print(nums)ans = []for i in range(l – 1):for j in range(i +…

  • third one with image

    try to upload an image to test it online

  • how python works in AI

    python, java or c++?

Design a site like this with WordPress.com
Get started