zoukankan      html  css  js  c++  java
  • 13位时间戳转时间 获取当前时间

    1 ,13位时间戳转时间  stamp =  1513478681000

    - (NSString *)timeStampConvertToDateWithStamp:(double )stamp {

        // 把时间戳转化成时间

        NSTimeInterval interval = stamp / 1000.0;

        NSDate *date = [NSDate dateWithTimeIntervalSince1970:interval];

        NSDateFormatter *objDateformat = [[NSDateFormatter alloc] init];

        [objDateformat setDateFormat:@"yyyy-MM-dd HH:mm:ss"];

        NSString * timeStr = [NSString stringWithFormat:@"%@",[objDateformat stringFromDate: date]];

        return timeStr;

    }

    2 , 获取当前时间

    NSDateFormatter *formatter = [[NSDateFormatter alloc] init];

        [formatter setDateFormat:@"YYYY-MM-dd HH:mm:ss"];

        NSDate *datenow = [NSDate date];

        NSString *currentTimeString = [formatter stringFromDate:datenow];

        NSLog(@"currentTimeString =  %@",currentTimeString);

    3, 获取两个时间之间的差

    - (NSInteger )countTwoDatesAreCalculatedWithStart:(NSString * )start End:(NSString *)end {

        //创建日期格式化对象

        NSDateFormatter *dateFormatter=[[NSDateFormatter alloc] init];

        [dateFormatter setDateFormat:@"yyyy-MM-dd HH:mm:ss"];

        

        NSDate *date1 = [dateFormatter dateFromString:start]; //start

        NSDate *date2 = [dateFormatter dateFromString:end]; //end

        //取两个日期对象的时间间隔:

        //这里的NSTimeInterval 并不是对象,是基本型,其实是double类型,是由c定义的:typedef double NSTimeInterval;

        NSTimeInterval time=[date2 timeIntervalSinceDate:date1];

        

        int days= ((int)time)/(3600*24);

        int hours=((int)time)%(3600*24)/3600;

        //NSString *dateContent=[[NSString alloc] initWithFormat:@"%i天%i小时",days,hours];

        return days;

    }

    4 , 获取当前时间的时间戳

        NSDate* localDate = [NSDate date];

        NSTimeInterval interval=[localDate timeIntervalSince1970];

        NSString *timestamp = [NSString stringWithFormat:@"%ld", (long)interval];

  • 相关阅读:
    [cf1038E][欧拉路]
    [最小费用最大流(板子)]
    [网络流24题]
    [ACM International Collegiate Programming Contest, Amman Collegiate Programming Contest (2018)]
    [Split The Tree][dfs序+树状数组求区间数的种数]
    [CSL 的魔法][求排序最少交换次数]
    [CSL 的字符串][栈,模拟]
    ZOJ 3949 Edge to the Root 树形DP
    第十三周 Leetcode 363. Max Sum of Rectangle No Larger Than K(HARD)
    POJ 2104 HDU 2665 主席树 解决区间第K大
  • 原文地址:https://www.cnblogs.com/Lovexiaohuzi/p/8037673.html
Copyright © 2011-2022 走看看