Coding everyday. ^_^

1. Two Sum

  • 重点知识:指针可以存储数值,通过 malloc 新建数组
  • int* returnSize:Size of the return array. Store the value in a pointer, say 2.
    *returnSize = 2
  • My solution:
  • /**
    * Note: The returned array must be malloced, assume caller calls free().
    */
    int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    *returnSize = 2;
    int* returnArray = malloc(sizeof(int)*(*returnSize));
    for (int i = 0; i < numsSize-1; i++) {
    for (int j = i+1; j < numsSize; j++) {
    if (nums[i] + nums[j] == target) {
    returnArray[0] = i;
    returnArray[1] = j;
    return returnArray;
    }
    }
    }
    returnArray[0] = -1;
    returnArray[1] = -1;
    return returnArray;
    }

2. Add Two Numbers

  • 重点知识:不能通过数字来计算,考虑进位,考虑链表遍历和插入节点,通过 malloc 新建节点
  • Don't use integer to calculate in this problem since the numbers are very long.
  • Need to consider carry bit.
  • This linked list's head is the first node.
  • My solution:
  • /**
    * Definition for singly-linked list.
    * struct ListNode {
    * int val;
    * struct ListNode *next;
    * };
    */ struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode* p1;
    struct ListNode* p2;
    struct ListNode* l3 = NULL;
    struct ListNode* p3 = NULL;
    p1 = l1;
    p2 = l2; int carry_bit = 0;
    while (p1 != NULL || p2 != NULL || carry_bit == 1) {
    int num1;
    int num2;
    int num3;
    if (p1 == NULL && p2 == NULL && carry_bit == 1) {
    num3 = 1;
    carry_bit = 0;
    }
    else {
    if (p1 == NULL) {
    num1 = 0;
    }
    else {
    num1 = p1->val;
    p1 = p1->next;
    }
    if (p2 == NULL) {
    num2 = 0;
    }
    else {
    num2 = p2->val;
    p2 = p2->next;
    } num3 = num1 + num2 + carry_bit;
    if (num3 >= 10) {
    carry_bit = 1;
    num3 = num3 - 10;
    }
    else {
    carry_bit = 0;
    }
    } struct ListNode* tmp;
    tmp = malloc(sizeof(struct ListNode));
    if (tmp == NULL) {
    fprintf(stderr, "Out of memory.\n");
    exit(1);
    }
    tmp->val = num3;
    tmp->next = NULL; if (p3 == NULL) {
    p3 = tmp;
    l3 = p3;
    }
    else {
    p3->next = tmp;
    p3 = p3->next;
    }
    } return l3;
    }

3. Longest Substring Without Repeating Characters

  • 重点知识:多层遍历,时间复杂度过高
  • My solution:
  • int lengthOfLongestSubstring(char * s){
    int length = strlen(s);
    if (length == 1){
    return 1;
    }
    int max = 0;
    for (int i = 0; i < length; i++) {
    int flag = 1;
    for (int j = i + 1; j < length & flag; j++) {
    for (int k = j - 1; k >= i; k--) {
    if (s[j] == s[k]) {
    int tmp = j - i;
    if (max < tmp) {
    max = tmp;
    }
    i = k;
    flag = 0;
    break;
    }
    if (k == i) {
    int tmp = j - i + 1;
    if (max < tmp) {
    max = tmp;
    }
    }
    }
    }
    }
    return max;
    }

【436】Solution for LeetCode Problems的更多相关文章

  1. about家庭智能设备部分硬件模块功能共享【协同工作】solution

    本人设备列表: Onda tablet {Android} wifi Desktop computer {win7.centos7} 外接蓝牙adapter PS interface 键盘.鼠标{与同 ...

  2. 【NOIP2012TG】solution

    D1T1(Vigenere) 题意:给你一个原串与一个密码串,问你按照题意规则加密后的密文. 解题思路:暴力模拟. #include <stdio.h> ],c[],u1[],u2[]; ...

  3. 【NOIP2014TG】solution

    链接:https://www.luogu.org/problem/lists?name=&orderitem=pid&tag=83|31 D1T1(rps) 题意:给你一个周期,以及胜 ...

  4. 【NOIP2016TG】solution

    传送门:https://www.luogu.org/problem/lists?name=&orderitem=pid&tag=83%7C33 D1T1(toys) 题意:有n个小人, ...

  5. 【NOIP2015TG】solution

    链接:https://www.luogu.org/problem/lists?name=&orderitem=pid&tag=83%2C32 D1T1(magic) 题意:看题目.. ...

  6. 【NOIP2013TG】solution

    链接:https://www.luogu.org/problem/lists?name=&orderitem=pid&tag=83%2C30 D1T1:转圈游戏(circle) 题意: ...

  7. 【NOIP2011TG】solution

    老师最近叫我把NOIPTG的题目给刷掉,于是就开始刷吧= = 链接:https://www.luogu.org/problem/lists?name=&orderitem=pid&ta ...

  8. 【AtCoder】AGC005F - Many Easy Problems

    题解 我们把一个点的贡献转化为一条边的贡献,因为边的数量是点的数量-1,最后再加上选点方案数\(\binom{n}{k}\)即可 一条边的贡献是\(\binom{n}{k} - \binom{a}{k ...

  9. 【C++】关键字回忆leetcode题解

    20200515 前缀和 no.560 20200518 动态规划 no.152 20200520 状态压缩 no.1371 20200521 中心扩散 no.5 20200523 滑动窗口 no.7 ...

随机推荐

  1. js弹窗输入

    <html> <head> <title>js输入对话框</title> </head> <body> <script l ...

  2. APP弱网测试工具(QNET)

    QNET介绍官网链接:https://wetest.qq.com/product/qnet 目前在测试移动设备上进行弱网络专项测试的方案主要有两种: 通过Android设备连接到PC上进行弱网络测试, ...

  3. 模拟赛20181031 雅礼 Wearry 养花 折射 画作

    % Day1 Solution % Wearry % Stay determined! 养花    考虑当 kkk 确定的时候如何求答案, 显然对于所有形如 [ak,(a+1)k)[ak, (a+1) ...

  4. Tensorflow细节-P80-深度神经网络

    1.本节多为复习内容,从以下图片可见一般: 2.学会使用 from numpy.random import RandomState 然后 rdm = RandomState(1) dataset_si ...

  5. MCMC蒙特卡罗马尔科夫模型

    https://www.cnblogs.com/pinard/p/6645766.html https://blog.csdn.net/saltriver/article/details/521949 ...

  6. CS229开源项目

    斯坦福大学CS 229机器学习备忘单: https://github.com/kaobeixingfu/stanford-cs-229-machine-learning CS229机器学习算法的Pyt ...

  7. 任晓蕊 2019-2020-1 20199302《Linux内核原理与分析》第四周作业

    实验内容 在实验楼的环境中敲入命令 cd LinuxKernel/ qemu -kernel linux-3.18.6/arch/x86/boot/bzImage -initrd rootfs.img ...

  8. 数码管一些列功能的verilog实现

    将数码管各段发光元件的正极连在一起称为共阳数码管,且该共点击链接电路电源的正极,而各段的负极连接驱动电路.它适用于低电平有效的驱动电路,当某段的驱动电平为低电平时,该段发亮:将数码管各段发光元件的负极 ...

  9. fhq treap ------ luogu P3369 【模板】普通平衡树(Treap/SBT)

    二次联通门 : LibreOJ #104. 普通平衡树 #include <cstdio> #include <iostream> #include <algorithm ...

  10. Luogu5591 小猪佩奇学数学 【单位根反演】

    题目链接:洛谷 \[ Ans=\frac{1}{k}(\sum_{i=0}^n\binom{n}{i}p^ii-\sum_{i=0}^n\binom{n}{i}p^i(i \ \mathrm{mod} ...